./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (memcleanup)
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/uthash-2.0.2/uthash_OAT_test5-3.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea']
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/uthash-2.0.2/uthash_OAT_test5-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:06:25,445 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:06:25,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf
[2024-11-07 16:06:25,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:06:25,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:06:25,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:06:25,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:06:25,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:06:25,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:06:25,586 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:06:25,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:06:25,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:06:25,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:06:25,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:06:25,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:06:25,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:06:25,590 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:06:25,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:06:25,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 16:06:25,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:06:25,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:06:25,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:06:25,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:06:25,592 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-memcleanup) )
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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea
[2024-11-07 16:06:25,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:06:25,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:06:25,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:06:25,916 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:06:25,917 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:06:25,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i
[2024-11-07 16:06:27,326 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:06:27,718 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:06:27,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i
[2024-11-07 16:06:27,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cda3318b3/c89457a81e5749fb8c0d130bf6596d0d/FLAG4c71a6ea2
[2024-11-07 16:06:27,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cda3318b3/c89457a81e5749fb8c0d130bf6596d0d
[2024-11-07 16:06:27,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:06:27,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:06:27,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:06:27,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:06:27,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:06:27,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:27" (1/1) ...
[2024-11-07 16:06:27,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da155ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:27, skipping insertion in model container
[2024-11-07 16:06:27,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:27" (1/1) ...
[2024-11-07 16:06:27,834 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:06:28,346 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 16:06:28,374 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 16:06:28,378 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 16:06:28,387 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 16:06:28,395 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 16:06:28,426 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 16:06:28,429 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 16:06:28,431 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 16:06:28,439 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 16:06:28,469 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 16:06:28,469 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 16:06:28,473 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 16:06:28,473 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 16:06:28,475 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 16:06:28,478 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 16:06:28,479 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 16:06:28,480 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 16:06:28,481 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 16:06:28,487 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 16:06:28,489 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 16:06:28,492 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 16:06:28,493 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 16:06:28,498 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 16:06:28,510 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:06:28,528 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 16:06:28,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a250196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:28, skipping insertion in model container
[2024-11-07 16:06:28,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:06:28,530 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-07 16:06:28,533 INFO L158 Benchmark]: Toolchain (without parser) took 763.95ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 66.3MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 16:06:28,533 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 16:06:28,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.36ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 66.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-07 16:06:28,535 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.04ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 760.36ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 66.3MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 760]: 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/uthash-2.0.2/uthash_OAT_test5-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 16:06:30,693 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 16:06:30,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf
[2024-11-07 16:06:30,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 16:06:30,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 16:06:30,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 16:06:30,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 16:06:30,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 16:06:30,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 16:06:30,841 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 16:06:30,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 16:06:30,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 16:06:30,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 16:06:30,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 16:06:30,842 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 16:06:30,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 16:06:30,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 16:06:30,842 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-07 16:06:30,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 16:06:30,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 16:06:30,845 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 16:06:30,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:06:30,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 16:06:30,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 16:06:30,846 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-memcleanup) )
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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea
[2024-11-07 16:06:31,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 16:06:31,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 16:06:31,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 16:06:31,144 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 16:06:31,144 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 16:06:31,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i
[2024-11-07 16:06:32,623 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 16:06:32,927 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 16:06:32,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i
[2024-11-07 16:06:32,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ddf6b356/299028ba5f88431a8510dabb0b5df4cc/FLAG7cdc6331b
[2024-11-07 16:06:33,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ddf6b356/299028ba5f88431a8510dabb0b5df4cc
[2024-11-07 16:06:33,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 16:06:33,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 16:06:33,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 16:06:33,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 16:06:33,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 16:06:33,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:33" (1/1) ...
[2024-11-07 16:06:33,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d95c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:33, skipping insertion in model container
[2024-11-07 16:06:33,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:33" (1/1) ...
[2024-11-07 16:06:33,245 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:06:33,622 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 16:06:33,647 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 16:06:33,651 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 16:06:33,655 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 16:06:33,662 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 16:06:33,689 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 16:06:33,691 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 16:06:33,694 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 16:06:33,699 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 16:06:33,723 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 16:06:33,725 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 16:06:33,727 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 16:06:33,728 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 16:06:33,729 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 16:06:33,731 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 16:06:33,732 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 16:06:33,735 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 16:06:33,736 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 16:06:33,743 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 16:06:33,746 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 16:06:33,747 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 16:06:33,747 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 16:06:33,750 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 16:06:33,757 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:06:33,777 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-07 16:06:33,792 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 16:06:33,832 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 16:06:33,844 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 16:06:33,845 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 16:06:33,848 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 16:06:33,851 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 16:06:33,867 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 16:06:33,869 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 16:06:33,871 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 16:06:33,875 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 16:06:33,893 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 16:06:33,894 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 16:06:33,895 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 16:06:33,896 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 16:06:33,897 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 16:06:33,914 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 16:06:33,915 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 16:06:33,915 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 16:06:33,916 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 16:06:33,922 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 16:06:33,924 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 16:06:33,925 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 16:06:33,926 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 16:06:33,928 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 16:06:33,933 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:06:33,940 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 16:06:34,027 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 16:06:34,070 INFO L204 MainTranslator]: Completed translation
[2024-11-07 16:06:34,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34 WrapperNode
[2024-11-07 16:06:34,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 16:06:34,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 16:06:34,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 16:06:34,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 16:06:34,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,221 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728
[2024-11-07 16:06:34,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 16:06:34,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 16:06:34,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 16:06:34,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 16:06:34,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,431 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1].
[2024-11-07 16:06:34,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 16:06:34,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 16:06:34,567 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 16:06:34,567 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 16:06:34,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (1/1) ...
[2024-11-07 16:06:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 16:06:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 16:06:34,603 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 16:06:34,611 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 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2024-11-07 16:06:34,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-07 16:06:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2
[2024-11-07 16:06:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-07 16:06:34,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-07 16:06:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2
[2024-11-07 16:06:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-07 16:06:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-07 16:06:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-07 16:06:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2024-11-07 16:06:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 16:06:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-07 16:06:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-07 16:06:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2
[2024-11-07 16:06:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2
[2024-11-07 16:06:34,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 16:06:34,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 16:06:34,950 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 16:06:34,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 16:06:49,607 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live.
[2024-11-07 16:06:49,608 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 16:06:49,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 16:06:49,630 INFO L316 CfgBuilder]: Removed 100 assume(true) statements.
[2024-11-07 16:06:49,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:06:49 BoogieIcfgContainer
[2024-11-07 16:06:49,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 16:06:49,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 16:06:49,632 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 16:06:49,637 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 16:06:49,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:06:33" (1/3) ...
[2024-11-07 16:06:49,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b809671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:06:49, skipping insertion in model container
[2024-11-07 16:06:49,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:34" (2/3) ...
[2024-11-07 16:06:49,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b809671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:06:49, skipping insertion in model container
[2024-11-07 16:06:49,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:06:49" (3/3) ...
[2024-11-07 16:06:49,639 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-3.i
[2024-11-07 16:06:49,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 16:06:49,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-07 16:06:49,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 16:06:49,702 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;@50ac44d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 16:06:49,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2024-11-07 16:06:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 16:06:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-07 16:06:49,720 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:49,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:06:49,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 334886841, now seen corresponding path program 1 times
[2024-11-07 16:06:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676484243]
[2024-11-07 16:06:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:49,735 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 16:06:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:49,739 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 16:06:49,741 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 16:06:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:49,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:49,993 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:50,003 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 16:06:50,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:50,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676484243]
[2024-11-07 16:06:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676484243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 16:06:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307588250]
[2024-11-07 16:06:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:50,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 16:06:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 16:06:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 16:06:50,041 INFO L87 Difference]: Start difference. First operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:50,085 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions.
[2024-11-07 16:06:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 16:06:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-07 16:06:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:50,097 INFO L225 Difference]: With dead ends: 321
[2024-11-07 16:06:50,097 INFO L226 Difference]: Without dead ends: 319
[2024-11-07 16:06:50,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 16:06:50,102 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:50,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 16:06:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states.
[2024-11-07 16:06:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319.
[2024-11-07 16:06:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 302 states have (on average 1.3112582781456954) internal successors, (396), 309 states have internal predecessors, (396), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-07 16:06:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 420 transitions.
[2024-11-07 16:06:50,177 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 420 transitions. Word has length 10
[2024-11-07 16:06:50,177 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 420 transitions.
[2024-11-07 16:06:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 420 transitions.
[2024-11-07 16:06:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-07 16:06:50,179 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:50,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 16:06:50,183 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 16:06:50,379 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 16:06:50,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:50,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash 909565367, now seen corresponding path program 1 times
[2024-11-07 16:06:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963369125]
[2024-11-07 16:06:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:50,381 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 16:06:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:50,384 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 16:06:50,385 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 16:06:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:50,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:50,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:50,592 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 16:06:50,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:50,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963369125]
[2024-11-07 16:06:50,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963369125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:50,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:50,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:06:50,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85149512]
[2024-11-07 16:06:50,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:06:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:06:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:06:50,598 INFO L87 Difference]: Start difference. First operand 319 states and 420 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 16:06:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:50,802 INFO L93 Difference]: Finished difference Result 566 states and 749 transitions.
[2024-11-07 16:06:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:06:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2024-11-07 16:06:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:50,813 INFO L225 Difference]: With dead ends: 566
[2024-11-07 16:06:50,813 INFO L226 Difference]: Without dead ends: 566
[2024-11-07 16:06:50,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:06:50,814 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 304 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:50,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 860 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:06:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states.
[2024-11-07 16:06:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 321.
[2024-11-07 16:06:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 304 states have (on average 1.3092105263157894) internal successors, (398), 311 states have internal predecessors, (398), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-07 16:06:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions.
[2024-11-07 16:06:50,846 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 11
[2024-11-07 16:06:50,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions.
[2024-11-07 16:06:50,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 16:06:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions.
[2024-11-07 16:06:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 16:06:50,850 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:50,850 INFO L215 NwaCegarLoop]: 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, 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, 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, 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, 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 16:06:50,853 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 (3)] Ended with exit code 0
[2024-11-07 16:06:51,051 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 16:06:51,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1663298653, now seen corresponding path program 1 times
[2024-11-07 16:06:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491637876]
[2024-11-07 16:06:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:51,054 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 16:06:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:51,056 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 16:06:51,058 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 16:06:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:51,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:51,687 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:06:51,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:51,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491637876]
[2024-11-07 16:06:51,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491637876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:51,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:51,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:06:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521052534]
[2024-11-07 16:06:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:06:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:06:51,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:06:51,744 INFO L87 Difference]: Start difference. First operand 321 states and 422 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:51,928 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions.
[2024-11-07 16:06:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:06:51,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152
[2024-11-07 16:06:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:51,930 INFO L225 Difference]: With dead ends: 324
[2024-11-07 16:06:51,930 INFO L226 Difference]: Without dead ends: 324
[2024-11-07 16:06:51,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:06:51,931 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 30 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:51,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1151 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:06:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2024-11-07 16:06:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324.
[2024-11-07 16:06:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 307 states have (on average 1.280130293159609) internal successors, (393), 314 states have internal predecessors, (393), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-07 16:06:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions.
[2024-11-07 16:06:51,949 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 152
[2024-11-07 16:06:51,949 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:51,949 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions.
[2024-11-07 16:06:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions.
[2024-11-07 16:06:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-07 16:06:51,955 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:51,955 INFO L215 NwaCegarLoop]: 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, 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, 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, 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, 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 16:06:51,971 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 16:06:52,156 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 16:06:52,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:52,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash -287494633, now seen corresponding path program 1 times
[2024-11-07 16:06:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5995132]
[2024-11-07 16:06:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:52,162 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 16:06:52,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:52,165 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 16:06:52,167 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 16:06:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:52,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:52,761 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:06:53,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:53,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:53,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5995132]
[2024-11-07 16:06:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5995132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:53,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 16:06:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584497937]
[2024-11-07 16:06:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 16:06:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 16:06:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:06:53,180 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:53,751 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions.
[2024-11-07 16:06:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 16:06:53,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152
[2024-11-07 16:06:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:53,755 INFO L225 Difference]: With dead ends: 420
[2024-11-07 16:06:53,756 INFO L226 Difference]: Without dead ends: 420
[2024-11-07 16:06:53,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 16:06:53,757 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 73 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:53,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 820 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 16:06:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states.
[2024-11-07 16:06:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 366.
[2024-11-07 16:06:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 349 states have (on average 1.2578796561604584) internal successors, (439), 356 states have internal predecessors, (439), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-07 16:06:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 463 transitions.
[2024-11-07 16:06:53,768 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 463 transitions. Word has length 152
[2024-11-07 16:06:53,768 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 463 transitions.
[2024-11-07 16:06:53,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 16:06:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 463 transitions.
[2024-11-07 16:06:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-07 16:06:53,770 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:53,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:06:53,786 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 16:06:53,974 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 16:06:53,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -126033427, now seen corresponding path program 1 times
[2024-11-07 16:06:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61898317]
[2024-11-07 16:06:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:53,976 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 16:06:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:53,978 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 16:06:53,980 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 16:06:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:54,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:54,694 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 16:06:54,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:54,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61898317]
[2024-11-07 16:06:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61898317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:06:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901422595]
[2024-11-07 16:06:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:54,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:06:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:06:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:06:54,730 INFO L87 Difference]: Start difference. First operand 366 states and 463 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:06:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:54,800 INFO L93 Difference]: Finished difference Result 369 states and 468 transitions.
[2024-11-07 16:06:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 16:06:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 167
[2024-11-07 16:06:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:54,803 INFO L225 Difference]: With dead ends: 369
[2024-11-07 16:06:54,803 INFO L226 Difference]: Without dead ends: 369
[2024-11-07 16:06:54,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:06:54,804 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:54,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1208 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:06:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states.
[2024-11-07 16:06:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369.
[2024-11-07 16:06:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 351 states have (on average 1.2592592592592593) internal successors, (442), 359 states have internal predecessors, (442), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:06:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions.
[2024-11-07 16:06:54,816 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 167
[2024-11-07 16:06:54,816 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:54,817 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions.
[2024-11-07 16:06:54,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-07 16:06:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions.
[2024-11-07 16:06:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-07 16:06:54,819 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:54,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:06:54,836 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 16:06:55,023 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 16:06:55,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:55,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash -36784469, now seen corresponding path program 1 times
[2024-11-07 16:06:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085533941]
[2024-11-07 16:06:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:55,025 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 16:06:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:55,027 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 16:06:55,028 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 16:06:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:55,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:55,784 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 16:06:55,861 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:06:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 16:06:56,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:56,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085533941]
[2024-11-07 16:06:56,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085533941] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:06:56,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:06:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-07 16:06:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839806135]
[2024-11-07 16:06:56,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:06:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 16:06:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:56,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 16:06:56,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 16:06:56,025 INFO L87 Difference]: Start difference. First operand 369 states and 468 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:06:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:56,357 INFO L93 Difference]: Finished difference Result 380 states and 485 transitions.
[2024-11-07 16:06:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 16:06:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 169
[2024-11-07 16:06:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:56,360 INFO L225 Difference]: With dead ends: 380
[2024-11-07 16:06:56,360 INFO L226 Difference]: Without dead ends: 380
[2024-11-07 16:06:56,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110
[2024-11-07 16:06:56,361 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 5 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:56,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2002 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 16:06:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2024-11-07 16:06:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378.
[2024-11-07 16:06:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.2701949860724233) internal successors, (456), 367 states have internal predecessors, (456), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:06:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 482 transitions.
[2024-11-07 16:06:56,372 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 482 transitions. Word has length 169
[2024-11-07 16:06:56,372 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:56,372 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 482 transitions.
[2024-11-07 16:06:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:06:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 482 transitions.
[2024-11-07 16:06:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-07 16:06:56,377 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:56,378 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:06:56,396 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 (7)] Ended with exit code 0
[2024-11-07 16:06:56,578 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 16:06:56,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -560402163, now seen corresponding path program 2 times
[2024-11-07 16:06:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128135094]
[2024-11-07 16:06:56,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:06:56,580 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 16:06:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:56,583 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 16:06:56,585 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 16:06:57,000 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 16:06:57,000 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:06:57,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:57,010 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2024-11-07 16:06:57,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:06:57,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128135094]
[2024-11-07 16:06:57,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128135094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:06:57,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:06:57,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:06:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711341527]
[2024-11-07 16:06:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:06:57,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:06:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:06:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:06:57,049 INFO L87 Difference]: Start difference. First operand 378 states and 482 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:06:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:57,226 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions.
[2024-11-07 16:06:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:06:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173
[2024-11-07 16:06:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:57,230 INFO L225 Difference]: With dead ends: 381
[2024-11-07 16:06:57,231 INFO L226 Difference]: Without dead ends: 381
[2024-11-07 16:06:57,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:06:57,232 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 33 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1115 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:06:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states.
[2024-11-07 16:06:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381.
[2024-11-07 16:06:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 362 states have (on average 1.2458563535911602) internal successors, (451), 370 states have internal predecessors, (451), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:06:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 477 transitions.
[2024-11-07 16:06:57,247 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 477 transitions. Word has length 173
[2024-11-07 16:06:57,249 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 477 transitions.
[2024-11-07 16:06:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:06:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 477 transitions.
[2024-11-07 16:06:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2024-11-07 16:06:57,252 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:57,252 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:06:57,259 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 (8)] Forceful destruction successful, exit code 0
[2024-11-07 16:06:57,456 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 16:06:57,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:57,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2091914171, now seen corresponding path program 1 times
[2024-11-07 16:06:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208398715]
[2024-11-07 16:06:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:06:57,458 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 16:06:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:57,460 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 16:06:57,461 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 16:06:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:06:58,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 16:06:58,206 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:06:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-07 16:06:58,312 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:06:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 16:06:58,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:06:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208398715]
[2024-11-07 16:06:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208398715] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:06:58,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:06:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2024-11-07 16:06:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928426062]
[2024-11-07 16:06:58,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:06:58,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 16:06:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:06:58,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 16:06:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2024-11-07 16:06:58,610 INFO L87 Difference]: Start difference. First operand 381 states and 477 transitions. Second operand has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:06:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:06:59,428 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions.
[2024-11-07 16:06:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-11-07 16:06:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 173
[2024-11-07 16:06:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:06:59,431 INFO L225 Difference]: With dead ends: 396
[2024-11-07 16:06:59,431 INFO L226 Difference]: Without dead ends: 392
[2024-11-07 16:06:59,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506
[2024-11-07 16:06:59,432 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 16:06:59,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2733 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 16:06:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2024-11-07 16:06:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390.
[2024-11-07 16:06:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 371 states have (on average 1.247978436657682) internal successors, (463), 379 states have internal predecessors, (463), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:06:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 489 transitions.
[2024-11-07 16:06:59,448 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 489 transitions. Word has length 173
[2024-11-07 16:06:59,448 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:06:59,448 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 489 transitions.
[2024-11-07 16:06:59,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:06:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 489 transitions.
[2024-11-07 16:06:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-07 16:06:59,450 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:06:59,450 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:06:59,470 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 16:06:59,651 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 16:06:59,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:06:59,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:06:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1271566494, now seen corresponding path program 2 times
[2024-11-07 16:06:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:06:59,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823014133]
[2024-11-07 16:06:59,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:06:59,653 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 16:06:59,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:06:59,655 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 16:06:59,657 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 16:07:00,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-07 16:07:00,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:07:00,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:00,061 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2024-11-07 16:07:00,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:07:00,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823014133]
[2024-11-07 16:07:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823014133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:07:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:07:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 16:07:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995765957]
[2024-11-07 16:07:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:07:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 16:07:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 16:07:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:07:00,191 INFO L87 Difference]: Start difference. First operand 390 states and 489 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:07:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:07:00,269 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions.
[2024-11-07 16:07:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:07:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 182
[2024-11-07 16:07:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:07:00,272 INFO L225 Difference]: With dead ends: 384
[2024-11-07 16:07:00,273 INFO L226 Difference]: Without dead ends: 384
[2024-11-07 16:07:00,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:07:00,273 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 8 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:07:00,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:07:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states.
[2024-11-07 16:07:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384.
[2024-11-07 16:07:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 373 states have internal predecessors, (453), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:07:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 479 transitions.
[2024-11-07 16:07:00,287 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 479 transitions. Word has length 182
[2024-11-07 16:07:00,288 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:07:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 479 transitions.
[2024-11-07 16:07:00,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:07:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 479 transitions.
[2024-11-07 16:07:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-07 16:07:00,290 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:07:00,291 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:07:00,298 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 16:07:00,491 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 16:07:00,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:07:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:07:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1733672280, now seen corresponding path program 1 times
[2024-11-07 16:07:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:07:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127257547]
[2024-11-07 16:07:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:07:00,492 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 16:07:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:07:00,494 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 16:07:00,496 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 16:07:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:07:01,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:01,216 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 16:07:01,426 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:07:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 16:07:02,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127257547]
[2024-11-07 16:07:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127257547] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:07:02,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:07:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-07 16:07:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932715514]
[2024-11-07 16:07:02,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:07:02,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-07 16:07:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-07 16:07:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2024-11-07 16:07:02,088 INFO L87 Difference]: Start difference. First operand 384 states and 479 transitions. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:07:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:07:04,189 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions.
[2024-11-07 16:07:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-07 16:07:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 182
[2024-11-07 16:07:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:07:04,191 INFO L225 Difference]: With dead ends: 408
[2024-11-07 16:07:04,192 INFO L226 Difference]: Without dead ends: 404
[2024-11-07 16:07:04,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162
[2024-11-07 16:07:04,193 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 13 mSDsluCounter, 4249 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4638 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-07 16:07:04,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4638 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-07 16:07:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states.
[2024-11-07 16:07:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402.
[2024-11-07 16:07:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.2454308093994777) internal successors, (477), 391 states have internal predecessors, (477), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:07:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 503 transitions.
[2024-11-07 16:07:04,209 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 503 transitions. Word has length 182
[2024-11-07 16:07:04,209 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:07:04,209 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 503 transitions.
[2024-11-07 16:07:04,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:07:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 503 transitions.
[2024-11-07 16:07:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2024-11-07 16:07:04,212 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:07:04,212 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:07:04,233 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 16:07:04,413 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 16:07:04,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:07:04,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:07:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2132704952, now seen corresponding path program 2 times
[2024-11-07 16:07:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:07:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017349410]
[2024-11-07 16:07:04,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:07:04,415 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 16:07:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:07:04,417 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 16:07:04,420 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 16:07:05,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 16:07:05,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:07:05,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:05,315 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-07 16:07:06,236 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:07:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2024-11-07 16:07:08,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:08,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017349410]
[2024-11-07 16:07:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017349410] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:07:08,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:07:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50
[2024-11-07 16:07:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777633289]
[2024-11-07 16:07:08,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:07:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-11-07 16:07:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:08,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-11-07 16:07:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450
[2024-11-07 16:07:08,161 INFO L87 Difference]: Start difference. First operand 402 states and 503 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:07:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:07:14,460 INFO L93 Difference]: Finished difference Result 442 states and 576 transitions.
[2024-11-07 16:07:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2024-11-07 16:07:14,461 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200
[2024-11-07 16:07:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:07:14,463 INFO L225 Difference]: With dead ends: 442
[2024-11-07 16:07:14,463 INFO L226 Difference]: Without dead ends: 438
[2024-11-07 16:07:14,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556
[2024-11-07 16:07:14,466 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 26 mSDsluCounter, 8882 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9271 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2024-11-07 16:07:14,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9271 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2024-11-07 16:07:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2024-11-07 16:07:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436.
[2024-11-07 16:07:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 417 states have (on average 1.2541966426858513) internal successors, (523), 425 states have internal predecessors, (523), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:07:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 549 transitions.
[2024-11-07 16:07:14,478 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 549 transitions. Word has length 200
[2024-11-07 16:07:14,478 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:07:14,478 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 549 transitions.
[2024-11-07 16:07:14,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 16:07:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 549 transitions.
[2024-11-07 16:07:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2024-11-07 16:07:14,480 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:07:14,480 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:07:14,501 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 16:07:14,684 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 16:07:14,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:07:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:07:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1385395288, now seen corresponding path program 3 times
[2024-11-07 16:07:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:07:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844438725]
[2024-11-07 16:07:14,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 16:07:14,686 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 16:07:14,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:07:14,688 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 16:07:14,690 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 16:07:15,451 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-11-07 16:07:15,452 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:07:15,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:15,475 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked.
[2024-11-07 16:07:15,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 16:07:15,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844438725]
[2024-11-07 16:07:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844438725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 16:07:15,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 16:07:15,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 16:07:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123616515]
[2024-11-07 16:07:15,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 16:07:15,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 16:07:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:15,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 16:07:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 16:07:15,503 INFO L87 Difference]: Start difference. First operand 436 states and 549 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:07:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:07:15,603 INFO L93 Difference]: Finished difference Result 439 states and 544 transitions.
[2024-11-07 16:07:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 16:07:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2024-11-07 16:07:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:07:15,607 INFO L225 Difference]: With dead ends: 439
[2024-11-07 16:07:15,607 INFO L226 Difference]: Without dead ends: 439
[2024-11-07 16:07:15,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 16:07:15,608 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 16:07:15,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 16:07:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2024-11-07 16:07:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439.
[2024-11-07 16:07:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 420 states have (on average 1.2333333333333334) internal successors, (518), 428 states have internal predecessors, (518), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:07:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 544 transitions.
[2024-11-07 16:07:15,621 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 544 transitions. Word has length 234
[2024-11-07 16:07:15,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:07:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 544 transitions.
[2024-11-07 16:07:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-07 16:07:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 544 transitions.
[2024-11-07 16:07:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2024-11-07 16:07:15,623 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:07:15,623 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:07:15,641 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 16:07:15,823 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 16:07:15,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:07:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:07:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 119238068, now seen corresponding path program 1 times
[2024-11-07 16:07:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:07:15,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789557650]
[2024-11-07 16:07:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 16:07:15,825 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 16:07:15,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:07:15,829 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 16:07:15,830 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 16:07:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 16:07:17,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:17,254 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:07:17,784 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:07:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:07:19,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789557650]
[2024-11-07 16:07:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789557650] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:07:19,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:07:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52
[2024-11-07 16:07:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308025364]
[2024-11-07 16:07:19,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:07:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states
[2024-11-07 16:07:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2024-11-07 16:07:19,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652
[2024-11-07 16:07:19,475 INFO L87 Difference]: Start difference. First operand 439 states and 544 transitions. Second operand has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 16:07:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 16:07:26,218 INFO L93 Difference]: Finished difference Result 468 states and 600 transitions.
[2024-11-07 16:07:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2024-11-07 16:07:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234
[2024-11-07 16:07:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 16:07:26,221 INFO L225 Difference]: With dead ends: 468
[2024-11-07 16:07:26,221 INFO L226 Difference]: Without dead ends: 468
[2024-11-07 16:07:26,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702
[2024-11-07 16:07:26,224 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 26 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2024-11-07 16:07:26,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9332 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2024-11-07 16:07:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states.
[2024-11-07 16:07:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464.
[2024-11-07 16:07:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 445 states have (on average 1.2764044943820225) internal successors, (568), 453 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13)
[2024-11-07 16:07:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 594 transitions.
[2024-11-07 16:07:26,234 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 594 transitions. Word has length 234
[2024-11-07 16:07:26,234 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 16:07:26,234 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 594 transitions.
[2024-11-07 16:07:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-07 16:07:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 594 transitions.
[2024-11-07 16:07:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2024-11-07 16:07:26,236 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 16:07:26,237 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 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, 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, 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, 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, 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, 1]
[2024-11-07 16:07:26,266 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 (14)] Forceful destruction successful, exit code 0
[2024-11-07 16:07:26,437 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 16:07:26,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] ===
[2024-11-07 16:07:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 16:07:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1816448941, now seen corresponding path program 2 times
[2024-11-07 16:07:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 16:07:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263184037]
[2024-11-07 16:07:26,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 16:07:26,439 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 16:07:26,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 16:07:26,441 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 16:07:26,442 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 16:07:28,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 16:07:28,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 16:07:28,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core
[2024-11-07 16:07:28,562 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 16:07:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:07:30,158 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 16:07:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked.
[2024-11-07 16:07:36,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 16:07:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263184037]
[2024-11-07 16:07:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263184037] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 16:07:36,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 16:07:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102
[2024-11-07 16:07:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155909293]
[2024-11-07 16:07:36,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 16:07:36,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states
[2024-11-07 16:07:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 16:07:36,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants.
[2024-11-07 16:07:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302
[2024-11-07 16:07:36,454 INFO L87 Difference]: Start difference. First operand 464 states and 594 transitions. Second operand has 102 states, 102 states have (on average 2.5686274509803924) internal successors, (262), 102 states have internal predecessors, (262), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)