./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/ldv-races/race-2_2-container_of.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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0'] 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/ldv-races/race-2_2-container_of.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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:49,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:49,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:20:49,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:49,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:49,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:49,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:49,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:49,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:49,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:49,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:49,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:49,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:49,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:49,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:49,468 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:49,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:49,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:49,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:49,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:49,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:49,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:49,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:20:49,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:20:49,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:49,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:49,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:49,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:49,471 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-11-07 19:20:49,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:49,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:49,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:49,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:49,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:49,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-07 19:20:50,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:51,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:51,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-07 19:20:51,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/939219a41/a28f43970fc24946ba269d0468bf7177/FLAGe70b8acd9 [2024-11-07 19:20:51,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/939219a41/a28f43970fc24946ba269d0468bf7177 [2024-11-07 19:20:51,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:51,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:51,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:51,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:51,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:51,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:51" (1/1) ... [2024-11-07 19:20:51,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a60683e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:51, skipping insertion in model container [2024-11-07 19:20:51,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:51" (1/1) ... [2024-11-07 19:20:51,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:51,523 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:51,530 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:51,535 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:51,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:51,556 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) [2024-11-07 19:20:51,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7276561a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:51, skipping insertion in model container [2024-11-07 19:20:51,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:51,557 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 19:20:51,558 INFO L158 Benchmark]: Toolchain (without parser) took 338.80ms. Allocated memory is still 117.4MB. Free memory was 88.1MB in the beginning and 70.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:20:51,558 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:51,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.08ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 70.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:20:51,560 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.57ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.08ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 70.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: 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/ldv-races/race-2_2-container_of.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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:53,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:53,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:20:53,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:53,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:53,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:53,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:53,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:53,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:53,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:53,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:53,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:53,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:53,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:53,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:53,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:53,232 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:53,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:53,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:53,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:53,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:53,234 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2024-11-07 19:20:53,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:53,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:53,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:53,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:53,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:53,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-07 19:20:54,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:54,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:54,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2024-11-07 19:20:54,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9705d0b09/fcb7d576c07a4d2b9ff4ddc121535957/FLAG71ea4bd16 [2024-11-07 19:20:54,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9705d0b09/fcb7d576c07a4d2b9ff4ddc121535957 [2024-11-07 19:20:54,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:54,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:54,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:54,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:54,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:54,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:54" (1/1) ... [2024-11-07 19:20:54,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a36971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:54, skipping insertion in model container [2024-11-07 19:20:54,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:54" (1/1) ... [2024-11-07 19:20:54,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:55,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,124 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:55,148 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 19:20:55,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:55,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:55,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:55,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:20:55,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:55,281 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:20:55,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55 WrapperNode [2024-11-07 19:20:55,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:55,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:55,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:20:55,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:20:55,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,314 INFO L138 Inliner]: procedures = 249, calls = 40, calls flagged for inlining = 11, calls inlined = 14, statements flattened = 118 [2024-11-07 19:20:55,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:55,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:20:55,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:20:55,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:20:55,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,344 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2024-11-07 19:20:55,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:20:55,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:20:55,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:20:55,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:20:55,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (1/1) ... [2024-11-07 19:20:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:20:55,407 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) [2024-11-07 19:20:55,409 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 [2024-11-07 19:20:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-07 19:20:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:20:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:20:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:20:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:20:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:20:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:20:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:20:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:20:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:20:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:20:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:20:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:20:55,434 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:20:55,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:20:55,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:20:56,012 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:20:56,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:20:56,138 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:20:56,139 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:20:56,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:56 BoogieIcfgContainer [2024-11-07 19:20:56,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:20:56,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:20:56,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:20:56,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:20:56,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:20:54" (1/3) ... [2024-11-07 19:20:56,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c4e61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:56, skipping insertion in model container [2024-11-07 19:20:56,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:55" (2/3) ... [2024-11-07 19:20:56,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c4e61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:56, skipping insertion in model container [2024-11-07 19:20:56,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:56" (3/3) ... [2024-11-07 19:20:56,146 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-11-07 19:20:56,155 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:20:56,155 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-07 19:20:56,155 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:20:56,202 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:20:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 104 transitions, 222 flow [2024-11-07 19:20:56,272 INFO L124 PetriNetUnfolderBase]: 14/137 cut-off events. [2024-11-07 19:20:56,275 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:20:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 137 events. 14/137 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 435 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2024-11-07 19:20:56,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 104 transitions, 222 flow [2024-11-07 19:20:56,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 102 transitions, 216 flow [2024-11-07 19:20:56,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:20:56,296 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;@465b1c19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:20:56,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-07 19:20:56,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:20:56,302 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 19:20:56,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:56,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:56,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:20:56,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:20:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:56,306 INFO L85 PathProgramCache]: Analyzing trace with hash 425203, now seen corresponding path program 1 times [2024-11-07 19:20:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149354426] [2024-11-07 19:20:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:56,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:56,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:20:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:56,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:56,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:56,449 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 [2024-11-07 19:20:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:56,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:56,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149354426] [2024-11-07 19:20:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149354426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:56,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:56,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957482120] [2024-11-07 19:20:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:56,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:56,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:20:56,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:56,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:56,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:20:56,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:57,395 INFO L124 PetriNetUnfolderBase]: 3071/7663 cut-off events. [2024-11-07 19:20:57,396 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-07 19:20:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12575 conditions, 7663 events. 3071/7663 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 73970 event pairs, 407 based on Foata normal form. 584/5609 useless extension candidates. Maximal degree in co-relation 12356. Up to 4146 conditions per place. [2024-11-07 19:20:57,434 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 72 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-11-07 19:20:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 110 transitions, 380 flow [2024-11-07 19:20:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-11-07 19:20:57,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2024-11-07 19:20:57,444 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 216 flow. Second operand 3 states and 198 transitions. [2024-11-07 19:20:57,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 110 transitions, 380 flow [2024-11-07 19:20:57,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 372 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:57,483 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 184 flow [2024-11-07 19:20:57,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2024-11-07 19:20:57,487 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -8 predicate places. [2024-11-07 19:20:57,487 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 184 flow [2024-11-07 19:20:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:57,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:57,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:20:57,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:20:57,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:57,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:20:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash 425204, now seen corresponding path program 1 times [2024-11-07 19:20:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344854398] [2024-11-07 19:20:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:57,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:57,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:20:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:57,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:20:57,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:57,777 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 [2024-11-07 19:20:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:57,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:57,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344854398] [2024-11-07 19:20:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344854398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956840242] [2024-11-07 19:20:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:57,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:57,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:20:57,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:57,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:57,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:20:57,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:58,556 INFO L124 PetriNetUnfolderBase]: 3071/7661 cut-off events. [2024-11-07 19:20:58,557 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-07 19:20:58,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 7661 events. 3071/7661 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 73799 event pairs, 407 based on Foata normal form. 1/5024 useless extension candidates. Maximal degree in co-relation 1458. Up to 4146 conditions per place. [2024-11-07 19:20:58,588 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 71 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2024-11-07 19:20:58,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 370 flow [2024-11-07 19:20:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-11-07 19:20:58,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-11-07 19:20:58,590 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 184 flow. Second operand 3 states and 192 transitions. [2024-11-07 19:20:58,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 370 flow [2024-11-07 19:20:58,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 108 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:58,595 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 180 flow [2024-11-07 19:20:58,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2024-11-07 19:20:58,595 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-11-07 19:20:58,596 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 180 flow [2024-11-07 19:20:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:58,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:58,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:20:58,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:58,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:20:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 13181125, now seen corresponding path program 1 times [2024-11-07 19:20:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655717720] [2024-11-07 19:20:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:58,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:58,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:58,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:58,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:20:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:58,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:20:58,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:58,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:58,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655717720] [2024-11-07 19:20:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655717720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151607524] [2024-11-07 19:20:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:58,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:58,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 104 [2024-11-07 19:20:58,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:58,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:58,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 104 [2024-11-07 19:20:58,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:59,311 INFO L124 PetriNetUnfolderBase]: 3070/6028 cut-off events. [2024-11-07 19:20:59,311 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-07 19:20:59,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11058 conditions, 6028 events. 3070/6028 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 45283 event pairs, 2805 based on Foata normal form. 1/4099 useless extension candidates. Maximal degree in co-relation 3361. Up to 4459 conditions per place. [2024-11-07 19:20:59,330 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 71 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-11-07 19:20:59,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 107 transitions, 368 flow [2024-11-07 19:20:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-11-07 19:20:59,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-11-07 19:20:59,332 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 180 flow. Second operand 3 states and 194 transitions. [2024-11-07 19:20:59,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 107 transitions, 368 flow [2024-11-07 19:20:59,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 107 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:59,334 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 178 flow [2024-11-07 19:20:59,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-11-07 19:20:59,335 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-11-07 19:20:59,335 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 178 flow [2024-11-07 19:20:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:59,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:59,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:59,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:20:59,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:20:59,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1612670941, now seen corresponding path program 1 times [2024-11-07 19:20:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493021755] [2024-11-07 19:20:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:59,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:59,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:20:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:59,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:20:59,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:59,636 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 [2024-11-07 19:20:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:59,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:59,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493021755] [2024-11-07 19:20:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493021755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:20:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143152079] [2024-11-07 19:20:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:59,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:20:59,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:59,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:59,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:20:59,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:00,524 INFO L124 PetriNetUnfolderBase]: 2554/6238 cut-off events. [2024-11-07 19:21:00,524 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2024-11-07 19:21:00,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 6238 events. 2554/6238 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 56428 event pairs, 47 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 9162. Up to 2287 conditions per place. [2024-11-07 19:21:00,546 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 135 selfloop transitions, 13 changer transitions 1/183 dead transitions. [2024-11-07 19:21:00,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 183 transitions, 675 flow [2024-11-07 19:21:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 485 transitions. [2024-11-07 19:21:00,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5829326923076923 [2024-11-07 19:21:00,550 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 178 flow. Second operand 8 states and 485 transitions. [2024-11-07 19:21:00,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 183 transitions, 675 flow [2024-11-07 19:21:00,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 183 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:00,562 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 261 flow [2024-11-07 19:21:00,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-07 19:21:00,565 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2024-11-07 19:21:00,565 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 261 flow [2024-11-07 19:21:00,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:00,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:00,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:00,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 19:21:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:00,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1612670942, now seen corresponding path program 1 times [2024-11-07 19:21:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:00,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864338370] [2024-11-07 19:21:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:00,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:00,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:00,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:00,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:21:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:00,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:00,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:00,873 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 [2024-11-07 19:21:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:00,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:00,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864338370] [2024-11-07 19:21:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864338370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:00,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545111295] [2024-11-07 19:21:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:00,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:01,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:21:01,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:01,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:01,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:21:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:01,757 INFO L124 PetriNetUnfolderBase]: 1721/4271 cut-off events. [2024-11-07 19:21:01,758 INFO L125 PetriNetUnfolderBase]: For 1432/1432 co-relation queries the response was YES. [2024-11-07 19:21:01,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8298 conditions, 4271 events. 1721/4271 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 36382 event pairs, 95 based on Foata normal form. 450/3721 useless extension candidates. Maximal degree in co-relation 7164. Up to 1957 conditions per place. [2024-11-07 19:21:01,773 INFO L140 encePairwiseOnDemand]: 96/104 looper letters, 120 selfloop transitions, 10 changer transitions 2/166 dead transitions. [2024-11-07 19:21:01,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 166 transitions, 685 flow [2024-11-07 19:21:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 421 transitions. [2024-11-07 19:21:01,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5782967032967034 [2024-11-07 19:21:01,776 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 261 flow. Second operand 7 states and 421 transitions. [2024-11-07 19:21:01,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 166 transitions, 685 flow [2024-11-07 19:21:01,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:01,784 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 312 flow [2024-11-07 19:21:01,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2024-11-07 19:21:01,785 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-11-07 19:21:01,786 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 312 flow [2024-11-07 19:21:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:01,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:01,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:01,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 19:21:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:01,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1549885201, now seen corresponding path program 1 times [2024-11-07 19:21:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729294784] [2024-11-07 19:21:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:01,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:01,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:01,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:21:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:02,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:02,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:02,090 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 [2024-11-07 19:21:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:02,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:02,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729294784] [2024-11-07 19:21:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729294784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:02,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520659423] [2024-11-07 19:21:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:02,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:02,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 104 [2024-11-07 19:21:02,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:02,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:02,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 104 [2024-11-07 19:21:02,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:02,478 INFO L124 PetriNetUnfolderBase]: 1973/3899 cut-off events. [2024-11-07 19:21:02,478 INFO L125 PetriNetUnfolderBase]: For 3268/3268 co-relation queries the response was YES. [2024-11-07 19:21:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9077 conditions, 3899 events. 1973/3899 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26642 event pairs, 1470 based on Foata normal form. 0/3246 useless extension candidates. Maximal degree in co-relation 7939. Up to 2462 conditions per place. [2024-11-07 19:21:02,546 INFO L140 encePairwiseOnDemand]: 95/104 looper letters, 73 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2024-11-07 19:21:02,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 105 transitions, 492 flow [2024-11-07 19:21:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2024-11-07 19:21:02,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2024-11-07 19:21:02,547 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 312 flow. Second operand 3 states and 174 transitions. [2024-11-07 19:21:02,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 105 transitions, 492 flow [2024-11-07 19:21:02,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 475 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:02,550 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 297 flow [2024-11-07 19:21:02,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2024-11-07 19:21:02,551 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2024-11-07 19:21:02,551 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 297 flow [2024-11-07 19:21:02,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:02,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:02,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:02,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:02,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:02,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:02,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1549885200, now seen corresponding path program 1 times [2024-11-07 19:21:02,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:02,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799896607] [2024-11-07 19:21:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:02,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:02,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:02,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:21:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:02,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:21:02,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:02,850 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 [2024-11-07 19:21:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:02,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:02,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799896607] [2024-11-07 19:21:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799896607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:02,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545320435] [2024-11-07 19:21:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:02,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:02,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 104 [2024-11-07 19:21:02,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:02,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:02,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 104 [2024-11-07 19:21:02,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:03,274 INFO L124 PetriNetUnfolderBase]: 1721/3468 cut-off events. [2024-11-07 19:21:03,274 INFO L125 PetriNetUnfolderBase]: For 2284/2284 co-relation queries the response was YES. [2024-11-07 19:21:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8092 conditions, 3468 events. 1721/3468 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23713 event pairs, 1073 based on Foata normal form. 146/3011 useless extension candidates. Maximal degree in co-relation 6954. Up to 1744 conditions per place. [2024-11-07 19:21:03,284 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 84 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2024-11-07 19:21:03,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 531 flow [2024-11-07 19:21:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2024-11-07 19:21:03,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-11-07 19:21:03,285 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 297 flow. Second operand 3 states and 189 transitions. [2024-11-07 19:21:03,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 531 flow [2024-11-07 19:21:03,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 113 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:03,290 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 317 flow [2024-11-07 19:21:03,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2024-11-07 19:21:03,291 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2024-11-07 19:21:03,291 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 317 flow [2024-11-07 19:21:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:03,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:03,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:03,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 19:21:03,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:03,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:03,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -707364456, now seen corresponding path program 1 times [2024-11-07 19:21:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497537596] [2024-11-07 19:21:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:03,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:03,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:21:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:03,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:03,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:03,603 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 [2024-11-07 19:21:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:03,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:03,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497537596] [2024-11-07 19:21:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497537596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:03,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:03,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156766757] [2024-11-07 19:21:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:03,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:03,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:03,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:21:03,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:03,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:03,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:21:03,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:04,467 INFO L124 PetriNetUnfolderBase]: 1301/2846 cut-off events. [2024-11-07 19:21:04,467 INFO L125 PetriNetUnfolderBase]: For 1702/1702 co-relation queries the response was YES. [2024-11-07 19:21:04,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 2846 events. 1301/2846 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 19557 event pairs, 83 based on Foata normal form. 0/2525 useless extension candidates. Maximal degree in co-relation 5720. Up to 1488 conditions per place. [2024-11-07 19:21:04,478 INFO L140 encePairwiseOnDemand]: 96/104 looper letters, 116 selfloop transitions, 13 changer transitions 1/159 dead transitions. [2024-11-07 19:21:04,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 820 flow [2024-11-07 19:21:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 408 transitions. [2024-11-07 19:21:04,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5604395604395604 [2024-11-07 19:21:04,480 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 317 flow. Second operand 7 states and 408 transitions. [2024-11-07 19:21:04,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 820 flow [2024-11-07 19:21:04,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:04,486 INFO L231 Difference]: Finished difference. Result has 106 places, 98 transitions, 390 flow [2024-11-07 19:21:04,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=106, PETRI_TRANSITIONS=98} [2024-11-07 19:21:04,487 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-11-07 19:21:04,487 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 98 transitions, 390 flow [2024-11-07 19:21:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:04,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:04,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:21:04,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:04,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:04,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -707364457, now seen corresponding path program 1 times [2024-11-07 19:21:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142448850] [2024-11-07 19:21:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:04,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:04,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 19:21:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:04,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:04,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:04,798 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 [2024-11-07 19:21:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:04,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:04,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:04,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142448850] [2024-11-07 19:21:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142448850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:04,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3014189] [2024-11-07 19:21:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:04,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:21:04,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 98 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:04,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:04,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:21:04,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:05,387 INFO L124 PetriNetUnfolderBase]: 1070/2320 cut-off events. [2024-11-07 19:21:05,387 INFO L125 PetriNetUnfolderBase]: For 2087/2087 co-relation queries the response was YES. [2024-11-07 19:21:05,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2320 events. 1070/2320 cut-off events. For 2087/2087 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15342 event pairs, 143 based on Foata normal form. 0/2230 useless extension candidates. Maximal degree in co-relation 4936. Up to 794 conditions per place. [2024-11-07 19:21:05,392 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 117 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-11-07 19:21:05,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 164 transitions, 900 flow [2024-11-07 19:21:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 457 transitions. [2024-11-07 19:21:05,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5492788461538461 [2024-11-07 19:21:05,394 INFO L175 Difference]: Start difference. First operand has 106 places, 98 transitions, 390 flow. Second operand 8 states and 457 transitions. [2024-11-07 19:21:05,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 164 transitions, 900 flow [2024-11-07 19:21:05,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 164 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:05,399 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 502 flow [2024-11-07 19:21:05,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=502, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-11-07 19:21:05,399 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-11-07 19:21:05,399 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 502 flow [2024-11-07 19:21:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:05,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:05,400 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:05,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 19:21:05,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:05,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1606105385, now seen corresponding path program 1 times [2024-11-07 19:21:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227689271] [2024-11-07 19:21:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:05,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:05,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:05,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 19:21:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:05,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:05,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:05,726 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 [2024-11-07 19:21:05,730 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 [2024-11-07 19:21:05,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:05,817 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 [2024-11-07 19:21:05,830 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:05,830 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 [2024-11-07 19:21:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:05,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:05,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:05,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227689271] [2024-11-07 19:21:05,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227689271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:05,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:05,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716090309] [2024-11-07 19:21:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:05,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:06,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:21:06,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:06,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:06,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:21:06,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:06,736 INFO L124 PetriNetUnfolderBase]: 1229/2612 cut-off events. [2024-11-07 19:21:06,736 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2024-11-07 19:21:06,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 2612 events. 1229/2612 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17880 event pairs, 296 based on Foata normal form. 27/2627 useless extension candidates. Maximal degree in co-relation 6541. Up to 745 conditions per place. [2024-11-07 19:21:06,744 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 131 selfloop transitions, 18 changer transitions 0/178 dead transitions. [2024-11-07 19:21:06,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 178 transitions, 1089 flow [2024-11-07 19:21:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 506 transitions. [2024-11-07 19:21:06,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405982905982906 [2024-11-07 19:21:06,746 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 502 flow. Second operand 9 states and 506 transitions. [2024-11-07 19:21:06,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 178 transitions, 1089 flow [2024-11-07 19:21:06,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 178 transitions, 1055 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:21:06,752 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 510 flow [2024-11-07 19:21:06,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2024-11-07 19:21:06,752 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-11-07 19:21:06,752 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 510 flow [2024-11-07 19:21:06,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:06,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:06,752 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:06,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:06,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1986062419, now seen corresponding path program 1 times [2024-11-07 19:21:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361888535] [2024-11-07 19:21:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:06,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:06,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 19:21:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:07,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:07,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:07,080 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 [2024-11-07 19:21:07,084 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 [2024-11-07 19:21:07,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:07,173 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 [2024-11-07 19:21:07,181 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:07,181 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 [2024-11-07 19:21:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:07,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:07,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361888535] [2024-11-07 19:21:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361888535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:07,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:07,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232844867] [2024-11-07 19:21:07,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:07,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:07,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 104 [2024-11-07 19:21:07,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:07,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:07,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 104 [2024-11-07 19:21:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:08,026 INFO L124 PetriNetUnfolderBase]: 1476/3057 cut-off events. [2024-11-07 19:21:08,026 INFO L125 PetriNetUnfolderBase]: For 5155/5155 co-relation queries the response was YES. [2024-11-07 19:21:08,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 3057 events. 1476/3057 cut-off events. For 5155/5155 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21688 event pairs, 488 based on Foata normal form. 24/3072 useless extension candidates. Maximal degree in co-relation 6600. Up to 701 conditions per place. [2024-11-07 19:21:08,036 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 133 selfloop transitions, 18 changer transitions 0/180 dead transitions. [2024-11-07 19:21:08,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 1130 flow [2024-11-07 19:21:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 505 transitions. [2024-11-07 19:21:08,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395299145299145 [2024-11-07 19:21:08,038 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 510 flow. Second operand 9 states and 505 transitions. [2024-11-07 19:21:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 1130 flow [2024-11-07 19:21:08,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 1086 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:21:08,047 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 506 flow [2024-11-07 19:21:08,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2024-11-07 19:21:08,048 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 17 predicate places. [2024-11-07 19:21:08,048 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 506 flow [2024-11-07 19:21:08,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:08,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:08,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 19:21:08,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:08,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1524540013, now seen corresponding path program 1 times [2024-11-07 19:21:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680940020] [2024-11-07 19:21:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:08,251 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:08,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 19:21:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:08,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 19:21:08,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:08,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,389 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 32 treesize of output 41 [2024-11-07 19:21:08,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,418 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:08,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:08,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-11-07 19:21:08,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:08,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-11-07 19:21:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:08,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:08,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680940020] [2024-11-07 19:21:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680940020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050018432] [2024-11-07 19:21:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:08,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:21:08,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 506 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:08,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:08,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:21:08,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:10,410 INFO L124 PetriNetUnfolderBase]: 1944/3749 cut-off events. [2024-11-07 19:21:10,410 INFO L125 PetriNetUnfolderBase]: For 8077/8077 co-relation queries the response was YES. [2024-11-07 19:21:10,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11843 conditions, 3749 events. 1944/3749 cut-off events. For 8077/8077 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26355 event pairs, 1162 based on Foata normal form. 140/3873 useless extension candidates. Maximal degree in co-relation 8868. Up to 2848 conditions per place. [2024-11-07 19:21:10,422 INFO L140 encePairwiseOnDemand]: 92/104 looper letters, 98 selfloop transitions, 27 changer transitions 0/151 dead transitions. [2024-11-07 19:21:10,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 1036 flow [2024-11-07 19:21:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:21:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:21:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 327 transitions. [2024-11-07 19:21:10,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5240384615384616 [2024-11-07 19:21:10,423 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 506 flow. Second operand 6 states and 327 transitions. [2024-11-07 19:21:10,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 1036 flow [2024-11-07 19:21:10,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 993 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:21:10,435 INFO L231 Difference]: Finished difference. Result has 118 places, 127 transitions, 766 flow [2024-11-07 19:21:10,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=118, PETRI_TRANSITIONS=127} [2024-11-07 19:21:10,435 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2024-11-07 19:21:10,435 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 127 transitions, 766 flow [2024-11-07 19:21:10,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:10,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:10,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:10,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 19:21:10,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:10,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1705197008, now seen corresponding path program 1 times [2024-11-07 19:21:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349562317] [2024-11-07 19:21:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:10,639 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:10,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 19:21:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:10,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:21:10,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:10,858 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_85| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_85| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_85|)))) is different from true [2024-11-07 19:21:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:10,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:10,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349562317] [2024-11-07 19:21:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349562317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428314698] [2024-11-07 19:21:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-07 19:21:10,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 104 [2024-11-07 19:21:10,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 127 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:10,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:10,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 104 [2024-11-07 19:21:10,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:11,443 INFO L124 PetriNetUnfolderBase]: 1965/3750 cut-off events. [2024-11-07 19:21:11,443 INFO L125 PetriNetUnfolderBase]: For 8606/8606 co-relation queries the response was YES. [2024-11-07 19:21:11,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 3750 events. 1965/3750 cut-off events. For 8606/8606 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25739 event pairs, 775 based on Foata normal form. 0/3737 useless extension candidates. Maximal degree in co-relation 11493. Up to 1607 conditions per place. [2024-11-07 19:21:11,456 INFO L140 encePairwiseOnDemand]: 82/104 looper letters, 112 selfloop transitions, 33 changer transitions 4/165 dead transitions. [2024-11-07 19:21:11,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 165 transitions, 1272 flow [2024-11-07 19:21:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2024-11-07 19:21:11,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2024-11-07 19:21:11,457 INFO L175 Difference]: Start difference. First operand has 118 places, 127 transitions, 766 flow. Second operand 5 states and 210 transitions. [2024-11-07 19:21:11,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 165 transitions, 1272 flow [2024-11-07 19:21:11,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 1272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:11,476 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 1019 flow [2024-11-07 19:21:11,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1019, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-11-07 19:21:11,477 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 27 predicate places. [2024-11-07 19:21:11,477 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 1019 flow [2024-11-07 19:21:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:11,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:11,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:11,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 19:21:11,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:11,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:11,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:11,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1414043803, now seen corresponding path program 1 times [2024-11-07 19:21:11,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:11,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954890385] [2024-11-07 19:21:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:11,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:11,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:11,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:11,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 19:21:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:11,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:21:11,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:11,800 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 [2024-11-07 19:21:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:11,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:11,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:11,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954890385] [2024-11-07 19:21:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954890385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559733419] [2024-11-07 19:21:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:11,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:11,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:21:11,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:11,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:11,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:21:11,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:12,231 INFO L124 PetriNetUnfolderBase]: 1872/3619 cut-off events. [2024-11-07 19:21:12,232 INFO L125 PetriNetUnfolderBase]: For 13296/13410 co-relation queries the response was YES. [2024-11-07 19:21:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14870 conditions, 3619 events. 1872/3619 cut-off events. For 13296/13410 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25185 event pairs, 952 based on Foata normal form. 1/3595 useless extension candidates. Maximal degree in co-relation 12954. Up to 3088 conditions per place. [2024-11-07 19:21:12,242 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 114 selfloop transitions, 5 changer transitions 0/147 dead transitions. [2024-11-07 19:21:12,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 1293 flow [2024-11-07 19:21:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-11-07 19:21:12,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-11-07 19:21:12,243 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 1019 flow. Second operand 3 states and 173 transitions. [2024-11-07 19:21:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 1293 flow [2024-11-07 19:21:12,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 147 transitions, 1216 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-07 19:21:12,267 INFO L231 Difference]: Finished difference. Result has 121 places, 139 transitions, 948 flow [2024-11-07 19:21:12,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=121, PETRI_TRANSITIONS=139} [2024-11-07 19:21:12,268 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 23 predicate places. [2024-11-07 19:21:12,268 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 139 transitions, 948 flow [2024-11-07 19:21:12,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:12,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:12,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:12,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1414043802, now seen corresponding path program 1 times [2024-11-07 19:21:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75238154] [2024-11-07 19:21:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:12,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:12,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:12,472 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:12,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 19:21:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:12,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:12,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:12,593 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 [2024-11-07 19:21:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:12,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:12,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75238154] [2024-11-07 19:21:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75238154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:12,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136304359] [2024-11-07 19:21:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:12,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:12,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:21:12,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:12,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:21:12,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:13,017 INFO L124 PetriNetUnfolderBase]: 1872/3612 cut-off events. [2024-11-07 19:21:13,018 INFO L125 PetriNetUnfolderBase]: For 11941/12073 co-relation queries the response was YES. [2024-11-07 19:21:13,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14621 conditions, 3612 events. 1872/3612 cut-off events. For 11941/12073 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24854 event pairs, 967 based on Foata normal form. 7/3594 useless extension candidates. Maximal degree in co-relation 14056. Up to 3088 conditions per place. [2024-11-07 19:21:13,027 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 114 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2024-11-07 19:21:13,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1222 flow [2024-11-07 19:21:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-11-07 19:21:13,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2024-11-07 19:21:13,028 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 948 flow. Second operand 3 states and 173 transitions. [2024-11-07 19:21:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1222 flow [2024-11-07 19:21:13,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 145 transitions, 1212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:13,046 INFO L231 Difference]: Finished difference. Result has 119 places, 137 transitions, 944 flow [2024-11-07 19:21:13,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=119, PETRI_TRANSITIONS=137} [2024-11-07 19:21:13,046 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 21 predicate places. [2024-11-07 19:21:13,046 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 944 flow [2024-11-07 19:21:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:13,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:13,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:13,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 19:21:13,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:13,247 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:13,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -614483816, now seen corresponding path program 1 times [2024-11-07 19:21:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:13,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339153613] [2024-11-07 19:21:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:13,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:13,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 19:21:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:13,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:13,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:13,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:13,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339153613] [2024-11-07 19:21:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339153613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:13,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:13,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801726586] [2024-11-07 19:21:13,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:13,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:13,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:13,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 104 [2024-11-07 19:21:13,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:13,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:13,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 104 [2024-11-07 19:21:13,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:13,577 INFO L124 PetriNetUnfolderBase]: 225/430 cut-off events. [2024-11-07 19:21:13,577 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2024-11-07 19:21:13,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 430 events. 225/430 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1458 event pairs, 35 based on Foata normal form. 36/465 useless extension candidates. Maximal degree in co-relation 1606. Up to 226 conditions per place. [2024-11-07 19:21:13,579 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 57 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-07 19:21:13,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 83 transitions, 527 flow [2024-11-07 19:21:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2024-11-07 19:21:13,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-11-07 19:21:13,580 INFO L175 Difference]: Start difference. First operand has 119 places, 137 transitions, 944 flow. Second operand 4 states and 216 transitions. [2024-11-07 19:21:13,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 83 transitions, 527 flow [2024-11-07 19:21:13,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 378 flow, removed 26 selfloop flow, removed 26 redundant places. [2024-11-07 19:21:13,582 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 202 flow [2024-11-07 19:21:13,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-11-07 19:21:13,583 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2024-11-07 19:21:13,583 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 202 flow [2024-11-07 19:21:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:13,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:13,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:13,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:13,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:13,783 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:13,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash -324214618, now seen corresponding path program 1 times [2024-11-07 19:21:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490369311] [2024-11-07 19:21:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:13,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:13,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:13,786 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:13,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 19:21:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:14,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 19:21:14,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:14,049 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 [2024-11-07 19:21:14,112 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 19:21:14,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 19:21:14,141 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 16 treesize of output 13 [2024-11-07 19:21:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:14,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:14,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:14,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490369311] [2024-11-07 19:21:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490369311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171319056] [2024-11-07 19:21:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:14,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 104 [2024-11-07 19:21:14,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:14,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:14,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 104 [2024-11-07 19:21:14,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:14,523 INFO L124 PetriNetUnfolderBase]: 225/429 cut-off events. [2024-11-07 19:21:14,523 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2024-11-07 19:21:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 429 events. 225/429 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1397 event pairs, 95 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 1228. Up to 179 conditions per place. [2024-11-07 19:21:14,525 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 51 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-11-07 19:21:14,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 382 flow [2024-11-07 19:21:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:21:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:21:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-11-07 19:21:14,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2024-11-07 19:21:14,526 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 202 flow. Second operand 6 states and 244 transitions. [2024-11-07 19:21:14,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 382 flow [2024-11-07 19:21:14,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:14,527 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 212 flow [2024-11-07 19:21:14,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2024-11-07 19:21:14,527 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -20 predicate places. [2024-11-07 19:21:14,527 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 212 flow [2024-11-07 19:21:14,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:14,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:14,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:14,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-07 19:21:14,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:14,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -384005253, now seen corresponding path program 1 times [2024-11-07 19:21:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:14,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060607132] [2024-11-07 19:21:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:14,731 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-07 19:21:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:14,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:14,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:14,988 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 [2024-11-07 19:21:14,991 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 [2024-11-07 19:21:15,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:15,091 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 [2024-11-07 19:21:15,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:15,099 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 [2024-11-07 19:21:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:15,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:15,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:15,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060607132] [2024-11-07 19:21:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060607132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441628340] [2024-11-07 19:21:15,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:15,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:15,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:15,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 104 [2024-11-07 19:21:15,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:15,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:15,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 104 [2024-11-07 19:21:15,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:15,287 INFO L124 PetriNetUnfolderBase]: 225/423 cut-off events. [2024-11-07 19:21:15,288 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2024-11-07 19:21:15,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 423 events. 225/423 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1360 event pairs, 199 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1225. Up to 409 conditions per place. [2024-11-07 19:21:15,289 INFO L140 encePairwiseOnDemand]: 94/104 looper letters, 43 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-11-07 19:21:15,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 294 flow [2024-11-07 19:21:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-11-07 19:21:15,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-11-07 19:21:15,290 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 212 flow. Second operand 4 states and 151 transitions. [2024-11-07 19:21:15,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 294 flow [2024-11-07 19:21:15,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 270 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:15,291 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 184 flow [2024-11-07 19:21:15,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-11-07 19:21:15,291 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -28 predicate places. [2024-11-07 19:21:15,291 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 184 flow [2024-11-07 19:21:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:15,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:15,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:15,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 19:21:15,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:15,492 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 660361786, now seen corresponding path program 1 times [2024-11-07 19:21:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389507952] [2024-11-07 19:21:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:15,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:15,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:15,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 19:21:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:15,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 19:21:15,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:15,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:15,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:15,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:15,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:15,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:15,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:15,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-07 19:21:16,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:16,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-07 19:21:16,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:16,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-11-07 19:21:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:16,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:16,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389507952] [2024-11-07 19:21:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389507952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:16,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:16,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:21:16,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694927875] [2024-11-07 19:21:16,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:16,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:21:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:16,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:21:16,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:21:17,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:21:17,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 184 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:17,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:17,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:21:17,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:23,775 INFO L124 PetriNetUnfolderBase]: 513/966 cut-off events. [2024-11-07 19:21:23,775 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2024-11-07 19:21:23,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 966 events. 513/966 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4449 event pairs, 13 based on Foata normal form. 2/968 useless extension candidates. Maximal degree in co-relation 2599. Up to 256 conditions per place. [2024-11-07 19:21:23,778 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 121 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2024-11-07 19:21:23,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 172 transitions, 889 flow [2024-11-07 19:21:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 19:21:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-07 19:21:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 814 transitions. [2024-11-07 19:21:23,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4604072398190045 [2024-11-07 19:21:23,780 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 184 flow. Second operand 17 states and 814 transitions. [2024-11-07 19:21:23,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 172 transitions, 889 flow [2024-11-07 19:21:23,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 172 transitions, 871 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:23,782 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 481 flow [2024-11-07 19:21:23,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=481, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-11-07 19:21:23,782 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2024-11-07 19:21:23,782 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 481 flow [2024-11-07 19:21:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:23,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:23,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:23,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 19:21:23,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:23,983 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:23,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1737643324, now seen corresponding path program 2 times [2024-11-07 19:21:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549228087] [2024-11-07 19:21:23,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:21:23,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:23,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:23,986 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:23,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 19:21:24,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:21:24,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 19:21:24,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:24,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:24,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:24,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:24,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:24,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-07 19:21:24,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:24,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-07 19:21:25,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:25,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-11-07 19:21:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:25,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:25,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:25,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549228087] [2024-11-07 19:21:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549228087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:25,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:21:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300160332] [2024-11-07 19:21:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:25,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:21:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:21:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:21:26,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:21:26,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 481 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:26,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:26,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:21:26,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:30,044 INFO L124 PetriNetUnfolderBase]: 914/1750 cut-off events. [2024-11-07 19:21:30,044 INFO L125 PetriNetUnfolderBase]: For 3035/3035 co-relation queries the response was YES. [2024-11-07 19:21:30,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5820 conditions, 1750 events. 914/1750 cut-off events. For 3035/3035 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9620 event pairs, 86 based on Foata normal form. 2/1752 useless extension candidates. Maximal degree in co-relation 5800. Up to 438 conditions per place. [2024-11-07 19:21:30,049 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 128 selfloop transitions, 67 changer transitions 0/206 dead transitions. [2024-11-07 19:21:30,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 206 transitions, 1406 flow [2024-11-07 19:21:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:21:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:21:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 764 transitions. [2024-11-07 19:21:30,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45913461538461536 [2024-11-07 19:21:30,051 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 481 flow. Second operand 16 states and 764 transitions. [2024-11-07 19:21:30,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 206 transitions, 1406 flow [2024-11-07 19:21:30,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 206 transitions, 1357 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:30,059 INFO L231 Difference]: Finished difference. Result has 114 places, 130 transitions, 958 flow [2024-11-07 19:21:30,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=958, PETRI_PLACES=114, PETRI_TRANSITIONS=130} [2024-11-07 19:21:30,059 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2024-11-07 19:21:30,060 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 130 transitions, 958 flow [2024-11-07 19:21:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:30,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:30,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:30,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 19:21:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:30,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1797279580, now seen corresponding path program 3 times [2024-11-07 19:21:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006217127] [2024-11-07 19:21:30,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:21:30,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:30,263 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:30,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 19:21:30,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:21:30,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:30,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 19:21:30,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:30,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:30,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:30,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:30,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:30,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2024-11-07 19:21:30,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:30,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 55 [2024-11-07 19:21:31,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 51 [2024-11-07 19:21:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:31,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:31,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006217127] [2024-11-07 19:21:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006217127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 19:21:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713270812] [2024-11-07 19:21:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:21:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:21:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:21:32,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 104 [2024-11-07 19:21:32,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 958 flow. Second operand has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:32,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:32,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 104 [2024-11-07 19:21:32,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:37,507 INFO L124 PetriNetUnfolderBase]: 953/1838 cut-off events. [2024-11-07 19:21:37,508 INFO L125 PetriNetUnfolderBase]: For 5463/5463 co-relation queries the response was YES. [2024-11-07 19:21:37,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6933 conditions, 1838 events. 953/1838 cut-off events. For 5463/5463 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10236 event pairs, 159 based on Foata normal form. 1/1839 useless extension candidates. Maximal degree in co-relation 6903. Up to 393 conditions per place. [2024-11-07 19:21:37,515 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 155 selfloop transitions, 69 changer transitions 0/233 dead transitions. [2024-11-07 19:21:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 233 transitions, 1937 flow [2024-11-07 19:21:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:21:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:21:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 783 transitions. [2024-11-07 19:21:37,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47055288461538464 [2024-11-07 19:21:37,516 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 958 flow. Second operand 16 states and 783 transitions. [2024-11-07 19:21:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 233 transitions, 1937 flow [2024-11-07 19:21:37,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 233 transitions, 1836 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-11-07 19:21:37,529 INFO L231 Difference]: Finished difference. Result has 124 places, 146 transitions, 1253 flow [2024-11-07 19:21:37,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1253, PETRI_PLACES=124, PETRI_TRANSITIONS=146} [2024-11-07 19:21:37,529 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2024-11-07 19:21:37,529 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 146 transitions, 1253 flow [2024-11-07 19:21:37,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.45454545454545) internal successors, (456), 11 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:37,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:37,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:37,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 19:21:37,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:37,731 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1011824510, now seen corresponding path program 1 times [2024-11-07 19:21:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474381798] [2024-11-07 19:21:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:37,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:37,734 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:37,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-07 19:21:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:37,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 19:21:37,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:38,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:38,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-11-07 19:21:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-11-07 19:21:38,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:38,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-11-07 19:21:38,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:38,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-11-07 19:21:38,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:38,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-11-07 19:21:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:38,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:38,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474381798] [2024-11-07 19:21:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474381798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 19:21:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885098265] [2024-11-07 19:21:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:21:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:21:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:21:39,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:21:39,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 146 transitions, 1253 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:39,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:39,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:21:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:43,550 INFO L124 PetriNetUnfolderBase]: 1016/1970 cut-off events. [2024-11-07 19:21:43,550 INFO L125 PetriNetUnfolderBase]: For 6673/6673 co-relation queries the response was YES. [2024-11-07 19:21:43,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8022 conditions, 1970 events. 1016/1970 cut-off events. For 6673/6673 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11166 event pairs, 153 based on Foata normal form. 1/1971 useless extension candidates. Maximal degree in co-relation 7988. Up to 1148 conditions per place. [2024-11-07 19:21:43,558 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 156 selfloop transitions, 75 changer transitions 0/239 dead transitions. [2024-11-07 19:21:43,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 239 transitions, 2376 flow [2024-11-07 19:21:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 19:21:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-07 19:21:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 809 transitions. [2024-11-07 19:21:43,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4321581196581197 [2024-11-07 19:21:43,559 INFO L175 Difference]: Start difference. First operand has 124 places, 146 transitions, 1253 flow. Second operand 18 states and 809 transitions. [2024-11-07 19:21:43,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 239 transitions, 2376 flow [2024-11-07 19:21:43,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 239 transitions, 2226 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:43,577 INFO L231 Difference]: Finished difference. Result has 148 places, 188 transitions, 1834 flow [2024-11-07 19:21:43,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1834, PETRI_PLACES=148, PETRI_TRANSITIONS=188} [2024-11-07 19:21:43,577 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 50 predicate places. [2024-11-07 19:21:43,578 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 188 transitions, 1834 flow [2024-11-07 19:21:43,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:43,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:43,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:43,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-07 19:21:43,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:43,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:43,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:43,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1309497594, now seen corresponding path program 2 times [2024-11-07 19:21:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194477825] [2024-11-07 19:21:43,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:21:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:43,783 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:43,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-07 19:21:44,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:21:44,032 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 19:21:44,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:44,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:44,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-11-07 19:21:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-11-07 19:21:44,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:44,614 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,614 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:44,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-11-07 19:21:44,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:44,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-11-07 19:21:44,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:44,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-11-07 19:21:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:44,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:44,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194477825] [2024-11-07 19:21:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194477825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 19:21:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263941851] [2024-11-07 19:21:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:44,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:21:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:21:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:21:45,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:21:45,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 188 transitions, 1834 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:45,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:45,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:21:45,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:51,660 INFO L124 PetriNetUnfolderBase]: 1195/2311 cut-off events. [2024-11-07 19:21:51,660 INFO L125 PetriNetUnfolderBase]: For 10516/10516 co-relation queries the response was YES. [2024-11-07 19:21:51,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10703 conditions, 2311 events. 1195/2311 cut-off events. For 10516/10516 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13619 event pairs, 190 based on Foata normal form. 2/2313 useless extension candidates. Maximal degree in co-relation 10660. Up to 1255 conditions per place. [2024-11-07 19:21:51,671 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 177 selfloop transitions, 107 changer transitions 0/292 dead transitions. [2024-11-07 19:21:51,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 292 transitions, 3258 flow [2024-11-07 19:21:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 19:21:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-07 19:21:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 902 transitions. [2024-11-07 19:21:51,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43365384615384617 [2024-11-07 19:21:51,673 INFO L175 Difference]: Start difference. First operand has 148 places, 188 transitions, 1834 flow. Second operand 20 states and 902 transitions. [2024-11-07 19:21:51,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 292 transitions, 3258 flow [2024-11-07 19:21:51,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 292 transitions, 3052 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-11-07 19:21:51,698 INFO L231 Difference]: Finished difference. Result has 172 places, 240 transitions, 2592 flow [2024-11-07 19:21:51,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2592, PETRI_PLACES=172, PETRI_TRANSITIONS=240} [2024-11-07 19:21:51,698 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 74 predicate places. [2024-11-07 19:21:51,698 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 240 transitions, 2592 flow [2024-11-07 19:21:51,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:51,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:51,699 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:51,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-07 19:21:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:51,899 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1697248544, now seen corresponding path program 3 times [2024-11-07 19:21:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502641201] [2024-11-07 19:21:51,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:21:51,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:51,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:51,902 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:51,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-07 19:21:52,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:21:52,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:52,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 19:21:52,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:52,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-11-07 19:21:52,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 28 disjoint index pairs (out of 66 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 42 [2024-11-07 19:21:52,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:52,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:52,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 81 [2024-11-07 19:21:52,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:52,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 129 [2024-11-07 19:21:52,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:52,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 285 [2024-11-07 19:21:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:52,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:52,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502641201] [2024-11-07 19:21:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502641201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:52,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:52,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 19:21:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073324556] [2024-11-07 19:21:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:52,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:21:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:21:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:21:54,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:21:54,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 240 transitions, 2592 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:54,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:54,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:21:54,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:58,603 INFO L124 PetriNetUnfolderBase]: 1564/3063 cut-off events. [2024-11-07 19:21:58,603 INFO L125 PetriNetUnfolderBase]: For 18519/18519 co-relation queries the response was YES. [2024-11-07 19:21:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15337 conditions, 3063 events. 1564/3063 cut-off events. For 18519/18519 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19608 event pairs, 329 based on Foata normal form. 2/3065 useless extension candidates. Maximal degree in co-relation 15287. Up to 1406 conditions per place. [2024-11-07 19:21:58,614 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 263 selfloop transitions, 133 changer transitions 0/404 dead transitions. [2024-11-07 19:21:58,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 404 transitions, 4787 flow [2024-11-07 19:21:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 19:21:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-07 19:21:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1022 transitions. [2024-11-07 19:21:58,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44667832167832167 [2024-11-07 19:21:58,615 INFO L175 Difference]: Start difference. First operand has 172 places, 240 transitions, 2592 flow. Second operand 22 states and 1022 transitions. [2024-11-07 19:21:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 404 transitions, 4787 flow [2024-11-07 19:21:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 404 transitions, 4437 flow, removed 140 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:58,677 INFO L231 Difference]: Finished difference. Result has 201 places, 291 transitions, 3433 flow [2024-11-07 19:21:58,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3433, PETRI_PLACES=201, PETRI_TRANSITIONS=291} [2024-11-07 19:21:58,678 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 103 predicate places. [2024-11-07 19:21:58,678 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 291 transitions, 3433 flow [2024-11-07 19:21:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:58,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:58,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:58,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-07 19:21:58,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:58,878 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:21:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1230141806, now seen corresponding path program 4 times [2024-11-07 19:21:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:58,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33424197] [2024-11-07 19:21:58,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:21:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:58,881 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:58,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-07 19:21:59,119 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:21:59,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:59,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 19:21:59,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:59,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:59,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 77 [2024-11-07 19:21:59,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 125 [2024-11-07 19:21:59,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:59,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,683 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:59,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 141 [2024-11-07 19:21:59,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 173 [2024-11-07 19:22:00,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:22:00,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 365 treesize of output 301 [2024-11-07 19:22:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:22:00,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:22:00,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:22:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33424197] [2024-11-07 19:22:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33424197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:22:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:22:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 19:22:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240723047] [2024-11-07 19:22:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:22:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:22:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:22:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:22:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:22:00,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 104 [2024-11-07 19:22:00,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 291 transitions, 3433 flow. Second operand has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:22:00,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:22:00,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 104 [2024-11-07 19:22:00,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:22:06,095 INFO L124 PetriNetUnfolderBase]: 1666/3283 cut-off events. [2024-11-07 19:22:06,096 INFO L125 PetriNetUnfolderBase]: For 22562/22562 co-relation queries the response was YES. [2024-11-07 19:22:06,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16824 conditions, 3283 events. 1666/3283 cut-off events. For 22562/22562 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21566 event pairs, 320 based on Foata normal form. 2/3285 useless extension candidates. Maximal degree in co-relation 16762. Up to 1795 conditions per place. [2024-11-07 19:22:06,115 INFO L140 encePairwiseOnDemand]: 85/104 looper letters, 219 selfloop transitions, 145 changer transitions 0/372 dead transitions. [2024-11-07 19:22:06,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 372 transitions, 4811 flow [2024-11-07 19:22:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 19:22:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-07 19:22:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 900 transitions. [2024-11-07 19:22:06,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2024-11-07 19:22:06,116 INFO L175 Difference]: Start difference. First operand has 201 places, 291 transitions, 3433 flow. Second operand 20 states and 900 transitions. [2024-11-07 19:22:06,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 372 transitions, 4811 flow [2024-11-07 19:22:06,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 372 transitions, 4640 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-11-07 19:22:06,234 INFO L231 Difference]: Finished difference. Result has 225 places, 324 transitions, 4104 flow [2024-11-07 19:22:06,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=3272, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4104, PETRI_PLACES=225, PETRI_TRANSITIONS=324} [2024-11-07 19:22:06,235 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 127 predicate places. [2024-11-07 19:22:06,235 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 324 transitions, 4104 flow [2024-11-07 19:22:06,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.07142857142857) internal successors, (561), 14 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:22:06,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:22:06,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:22:06,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-07 19:22:06,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:22:06,436 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (and 42 more)] === [2024-11-07 19:22:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:22:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 236066558, now seen corresponding path program 5 times [2024-11-07 19:22:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:22:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291442521] [2024-11-07 19:22:06,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:22:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:22:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:22:06,439 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:22:06,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-07 19:22:06,705 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:22:06,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:22:06,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:22:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:22:06,883 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:22:06,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:22:06,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2024-11-07 19:22:06,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (24 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (21 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2024-11-07 19:22:06,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2024-11-07 19:22:06,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2024-11-07 19:22:06,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-07 19:22:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:22:07,089 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:22:07,130 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:22:07,130 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:22:07,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:22:07 BasicIcfg [2024-11-07 19:22:07,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:22:07,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:22:07,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:22:07,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:22:07,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:56" (3/4) ... [2024-11-07 19:22:07,135 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:22:07,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:22:07,136 INFO L158 Benchmark]: Toolchain (without parser) took 72287.63ms. Allocated memory was 117.4MB in the beginning and 805.3MB in the end (delta: 687.9MB). Free memory was 90.4MB in the beginning and 640.3MB in the end (delta: -549.9MB). Peak memory consumption was 138.7MB. Max. memory is 16.1GB. [2024-11-07 19:22:07,136 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:22:07,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.72ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 49.0MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-07 19:22:07,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 46.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:22:07,137 INFO L158 Benchmark]: Boogie Preprocessor took 60.04ms. Allocated memory is still 117.4MB. Free memory was 46.6MB in the beginning and 88.0MB in the end (delta: -41.5MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-07 19:22:07,137 INFO L158 Benchmark]: RCFGBuilder took 764.01ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 77.6MB in the end (delta: 10.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-07 19:22:07,137 INFO L158 Benchmark]: TraceAbstraction took 70991.79ms. Allocated memory was 117.4MB in the beginning and 805.3MB in the end (delta: 687.9MB). Free memory was 77.0MB in the beginning and 640.5MB in the end (delta: -563.5MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-07 19:22:07,137 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 805.3MB. Free memory was 640.5MB in the beginning and 640.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:22:07,138 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.14ms. Allocated memory is still 117.4MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.72ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 49.0MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 46.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.04ms. Allocated memory is still 117.4MB. Free memory was 46.6MB in the beginning and 88.0MB in the end (delta: -41.5MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 764.01ms. Allocated memory is still 117.4MB. Free memory was 88.0MB in the beginning and 77.6MB in the end (delta: 10.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * TraceAbstraction took 70991.79ms. Allocated memory was 117.4MB in the beginning and 805.3MB in the end (delta: 687.9MB). Free memory was 77.0MB in the beginning and 640.5MB in the end (delta: -563.5MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 805.3MB. Free memory was 640.5MB in the beginning and 640.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3932] 0 return 0; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result=0, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3917] 1 return 0; [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3917] 2 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={3:24}, \old(expression)=1, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, expression=1, lb=0, t1=0, t2=1] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_2-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_2-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3949]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 108 locations, 45 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 70.9s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 53.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4730 SdHoareTripleChecker+Valid, 40.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3963 mSDsluCounter, 2731 SdHoareTripleChecker+Invalid, 38.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 115 IncrementalHoareTripleChecker+Unchecked, 2555 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16522 IncrementalHoareTripleChecker+Invalid, 16819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 176 mSDtfsCounter, 16522 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 302 SyntacticMatches, 3 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4104occurred in iteration=25, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 420 ConstructedInterpolants, 25 QuantifiedInterpolants, 21265 SizeOfPredicates, 296 NumberOfNonLiveVariables, 4132 ConjunctsInSsa, 462 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:22:07,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample