./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd'] 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_test9-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:56:13,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:56:13,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 18:56:13,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:56:13,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:56:13,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:56:13,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:56:13,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:56:13,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:56:13,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:56:13,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:56:13,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:56:13,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:56:13,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:56:13,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:56:13,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:56:13,779 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:56:13,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:56:13,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:56:13,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:56:13,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:56:13,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:56:13,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:56:13,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:56:13,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-11-07 18:56:14,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:56:14,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:56:14,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:56:14,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:56:14,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:56:14,084 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_test9-2.i [2024-11-07 18:56:15,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:56:15,811 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:56:15,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-07 18:56:15,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b65a3ea86/367561b74f39498e94843cb0dec74cbc/FLAG51b2a7d6f [2024-11-07 18:56:15,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b65a3ea86/367561b74f39498e94843cb0dec74cbc [2024-11-07 18:56:15,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:56:15,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:56:15,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:56:15,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:56:15,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:56:15,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:15" (1/1) ... [2024-11-07 18:56:15,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1c9810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:15, skipping insertion in model container [2024-11-07 18:56:15,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:15" (1/1) ... [2024-11-07 18:56:15,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:56:16,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 18:56:16,520 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 18:56:16,527 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 18:56:16,532 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 18:56:16,539 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 18:56:16,575 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 18:56:16,577 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 18:56:16,579 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 18:56:16,580 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 18:56:16,582 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 18:56:16,584 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 18:56:16,586 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 18:56:16,586 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 18:56:16,588 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 18:56:16,591 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 18:56:16,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:56:16,614 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 18:56:16,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c5b0c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:16, skipping insertion in model container [2024-11-07 18:56:16,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:56:16,617 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 18:56:16,619 INFO L158 Benchmark]: Toolchain (without parser) took 751.22ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 41.4MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 18:56:16,621 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 18:56:16,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.67ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 41.5MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 18:56:16,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.67ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 41.5MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: 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_test9-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:56:18,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:56:18,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 18:56:18,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:56:18,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:56:18,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:56:18,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:56:18,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:56:18,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:56:18,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:56:18,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:56:18,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:56:18,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:56:18,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:56:18,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:56:18,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:56:18,845 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:56:18,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:56:18,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:56:18,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:56:18,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:56:18,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:56:18,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:56:18,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:56:18,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:56:18,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-11-07 18:56:19,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:56:19,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:56:19,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:56:19,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:56:19,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:56:19,139 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_test9-2.i [2024-11-07 18:56:20,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:56:20,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:56:20,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-07 18:56:20,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a83dbeaf/580fc05456164cf99472d8ef136e0024/FLAG73770d8ac [2024-11-07 18:56:20,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a83dbeaf/580fc05456164cf99472d8ef136e0024 [2024-11-07 18:56:20,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:56:20,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:56:20,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:56:20,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:56:20,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:56:20,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:20" (1/1) ... [2024-11-07 18:56:20,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3594cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:20, skipping insertion in model container [2024-11-07 18:56:20,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:20" (1/1) ... [2024-11-07 18:56:20,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:56:21,587 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 18:56:21,611 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 18:56:21,615 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 18:56:21,618 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 18:56:21,626 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 18:56:21,648 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 18:56:21,648 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 18:56:21,650 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 18:56:21,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 18:56:21,652 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 18:56:21,654 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 18:56:21,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 18:56:21,658 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 18:56:21,659 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 18:56:21,661 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 18:56:21,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:56:21,683 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 18:56:21,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:56:21,787 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 18:56:21,803 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 18:56:21,806 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 18:56:21,809 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 18:56:21,813 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 18:56:21,850 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 18:56:21,852 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 18:56:21,854 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 18:56:21,854 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 18:56:21,856 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 18:56:21,858 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 18:56:21,859 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 18:56:21,859 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 18:56:21,860 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 18:56:21,866 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 18:56:21,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:56:21,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:56:21,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:56:22,019 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:56:22,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22 WrapperNode [2024-11-07 18:56:22,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:56:22,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:56:22,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:56:22,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:56:22,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,159 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-11-07 18:56:22,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:56:22,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:56:22,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:56:22,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:56:22,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,326 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-07 18:56:22,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:56:22,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:56:22,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:56:22,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:56:22,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (1/1) ... [2024-11-07 18:56:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:56:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:56:22,509 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 18:56:22,511 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 18:56:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 18:56:22,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 18:56:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:56:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 18:56:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 18:56:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 18:56:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:56:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 18:56:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:56:22,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:56:22,785 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:56:22,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:56:22,803 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:56:22,838 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:56:22,858 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:56:27,395 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-11-07 18:56:27,396 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:56:27,445 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:56:27,446 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 18:56:27,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:27 BoogieIcfgContainer [2024-11-07 18:56:27,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:56:27,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:56:27,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:56:27,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:56:27,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:56:20" (1/3) ... [2024-11-07 18:56:27,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25265dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:27, skipping insertion in model container [2024-11-07 18:56:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:22" (2/3) ... [2024-11-07 18:56:27,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25265dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:27, skipping insertion in model container [2024-11-07 18:56:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:27" (3/3) ... [2024-11-07 18:56:27,455 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2024-11-07 18:56:27,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:56:27,472 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-07 18:56:27,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:56:27,557 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;@5ba6cd44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:56:27,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-07 18:56:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-07 18:56:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:56:27,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:27,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:56:27,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:27,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-07 18:56:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:27,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578465889] [2024-11-07 18:56:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:27,589 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 18:56:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:27,593 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 18:56:27,594 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 18:56:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:27,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:56:27,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:27,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:27,811 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 18:56:27,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:27,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578465889] [2024-11-07 18:56:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578465889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:56:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163759361] [2024-11-07 18:56:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:27,852 INFO L87 Difference]: Start difference. First operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:56:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:29,979 INFO L93 Difference]: Finished difference Result 2238 states and 3305 transitions. [2024-11-07 18:56:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 18:56:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:30,007 INFO L225 Difference]: With dead ends: 2238 [2024-11-07 18:56:30,007 INFO L226 Difference]: Without dead ends: 2236 [2024-11-07 18:56:30,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:56:30,010 INFO L432 NwaCegarLoop]: 2640 mSDtfsCounter, 1973 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:30,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 2796 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 18:56:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2024-11-07 18:56:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2057. [2024-11-07 18:56:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1040 states have (on average 2.0259615384615386) internal successors, (2107), 2050 states have internal predecessors, (2107), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 18:56:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3115 transitions. [2024-11-07 18:56:30,348 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3115 transitions. Word has length 3 [2024-11-07 18:56:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:30,348 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3115 transitions. [2024-11-07 18:56:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:56:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3115 transitions. [2024-11-07 18:56:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:56:30,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:30,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:56:30,353 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 18:56:30,552 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 18:56:30,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-07 18:56:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077677261] [2024-11-07 18:56:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:30,554 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 18:56:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:30,556 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 18:56:30,558 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 18:56:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:30,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:56:30,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:56:30,676 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 18:56:30,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:30,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077677261] [2024-11-07 18:56:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077677261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:56:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621456236] [2024-11-07 18:56:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:30,679 INFO L87 Difference]: Start difference. First operand 2057 states and 3115 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:56:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:33,355 INFO L93 Difference]: Finished difference Result 3474 states and 5565 transitions. [2024-11-07 18:56:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-07 18:56:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:33,374 INFO L225 Difference]: With dead ends: 3474 [2024-11-07 18:56:33,374 INFO L226 Difference]: Without dead ends: 3474 [2024-11-07 18:56:33,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:56:33,375 INFO L432 NwaCegarLoop]: 3017 mSDtfsCounter, 1449 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:33,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5104 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 18:56:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-07 18:56:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3185. [2024-11-07 18:56:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 1669 states have (on average 2.0029958058717794) internal successors, (3343), 3178 states have internal predecessors, (3343), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 5351 transitions. [2024-11-07 18:56:33,707 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 5351 transitions. Word has length 3 [2024-11-07 18:56:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:33,707 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 5351 transitions. [2024-11-07 18:56:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 18:56:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 5351 transitions. [2024-11-07 18:56:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 18:56:33,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:33,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:33,711 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 18:56:33,908 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 18:56:33,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:33,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:33,909 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-07 18:56:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603523358] [2024-11-07 18:56:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:33,910 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 18:56:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:33,915 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 18:56:33,917 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 18:56:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:34,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:56:34,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:34,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:56:34,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:34,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:56:34,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 18:56:34,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:56:34,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 18:56:34,181 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 18:56:34,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:34,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:34,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603523358] [2024-11-07 18:56:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603523358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:34,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318195387] [2024-11-07 18:56:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:34,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:34,182 INFO L87 Difference]: Start difference. First operand 3185 states and 5351 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 18:56:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:37,059 INFO L93 Difference]: Finished difference Result 3353 states and 5527 transitions. [2024-11-07 18:56:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:56:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-07 18:56:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:37,078 INFO L225 Difference]: With dead ends: 3353 [2024-11-07 18:56:37,079 INFO L226 Difference]: Without dead ends: 3353 [2024-11-07 18:56:37,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:37,080 INFO L432 NwaCegarLoop]: 2371 mSDtfsCounter, 2257 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:37,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2471 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 18:56:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2024-11-07 18:56:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2045. [2024-11-07 18:56:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1040 states have (on average 2.0134615384615384) internal successors, (2094), 2038 states have internal predecessors, (2094), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 18:56:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3102 transitions. [2024-11-07 18:56:37,291 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3102 transitions. Word has length 7 [2024-11-07 18:56:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:37,291 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3102 transitions. [2024-11-07 18:56:37,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 18:56:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3102 transitions. [2024-11-07 18:56:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:56:37,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:37,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:37,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 18:56:37,496 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 18:56:37,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:37,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-07 18:56:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:37,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2918445] [2024-11-07 18:56:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:37,498 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 18:56:37,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:37,500 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 18:56:37,501 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 18:56:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:37,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:56:37,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:37,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:56:37,652 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 18:56:37,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:37,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2918445] [2024-11-07 18:56:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2918445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:37,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:37,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:56:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279498669] [2024-11-07 18:56:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:37,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:37,653 INFO L87 Difference]: Start difference. First operand 2045 states and 3102 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 18:56:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:40,043 INFO L93 Difference]: Finished difference Result 3338 states and 5424 transitions. [2024-11-07 18:56:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-07 18:56:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:40,060 INFO L225 Difference]: With dead ends: 3338 [2024-11-07 18:56:40,060 INFO L226 Difference]: Without dead ends: 3338 [2024-11-07 18:56:40,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:56:40,062 INFO L432 NwaCegarLoop]: 4987 mSDtfsCounter, 1505 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:40,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 7415 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 18:56:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2024-11-07 18:56:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2072. [2024-11-07 18:56:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1077 states have (on average 2.007428040854225) internal successors, (2162), 2065 states have internal predecessors, (2162), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 18:56:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3170 transitions. [2024-11-07 18:56:40,296 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3170 transitions. Word has length 8 [2024-11-07 18:56:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:40,296 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3170 transitions. [2024-11-07 18:56:40,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 18:56:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3170 transitions. [2024-11-07 18:56:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:56:40,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:40,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:40,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 18:56:40,497 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 18:56:40,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-07 18:56:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122396106] [2024-11-07 18:56:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:40,499 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 18:56:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:40,500 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 18:56:40,501 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 18:56:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:40,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:56:40,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:40,609 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 18:56:40,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:40,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122396106] [2024-11-07 18:56:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122396106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:56:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095573066] [2024-11-07 18:56:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:40,612 INFO L87 Difference]: Start difference. First operand 2072 states and 3170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 18:56:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:42,183 INFO L93 Difference]: Finished difference Result 3242 states and 5358 transitions. [2024-11-07 18:56:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-07 18:56:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:42,196 INFO L225 Difference]: With dead ends: 3242 [2024-11-07 18:56:42,196 INFO L226 Difference]: Without dead ends: 3242 [2024-11-07 18:56:42,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:56:42,197 INFO L432 NwaCegarLoop]: 4761 mSDtfsCounter, 1754 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 7020 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:42,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 7020 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:56:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2024-11-07 18:56:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2025. [2024-11-07 18:56:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1077 states have (on average 1.9600742804085423) internal successors, (2111), 2018 states have internal predecessors, (2111), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-07 18:56:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3119 transitions. [2024-11-07 18:56:42,436 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3119 transitions. Word has length 8 [2024-11-07 18:56:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:42,436 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 3119 transitions. [2024-11-07 18:56:42,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 18:56:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3119 transitions. [2024-11-07 18:56:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:56:42,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:42,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:42,440 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 18:56:42,637 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 18:56:42,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:42,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash -282866277, now seen corresponding path program 1 times [2024-11-07 18:56:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573210614] [2024-11-07 18:56:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:42,639 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 18:56:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:42,641 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 18:56:42,642 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 18:56:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:42,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:56:42,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:42,795 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 18:56:42,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:42,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573210614] [2024-11-07 18:56:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573210614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:42,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717342693] [2024-11-07 18:56:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:42,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:42,797 INFO L87 Difference]: Start difference. First operand 2025 states and 3119 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 18:56:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:43,019 INFO L93 Difference]: Finished difference Result 3470 states and 5620 transitions. [2024-11-07 18:56:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:43,020 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 18:56:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:43,033 INFO L225 Difference]: With dead ends: 3470 [2024-11-07 18:56:43,033 INFO L226 Difference]: Without dead ends: 3470 [2024-11-07 18:56:43,034 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 18:56:43,035 INFO L432 NwaCegarLoop]: 3105 mSDtfsCounter, 1471 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:43,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 6058 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 18:56:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-07 18:56:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3202. [2024-11-07 18:56:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 1754 states have (on average 1.944697833523375) internal successors, (3411), 3195 states have internal predecessors, (3411), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5419 transitions. [2024-11-07 18:56:43,260 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5419 transitions. Word has length 11 [2024-11-07 18:56:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:43,260 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5419 transitions. [2024-11-07 18:56:43,260 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 18:56:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5419 transitions. [2024-11-07 18:56:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:56:43,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:43,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:43,280 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 18:56:43,461 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 18:56:43,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-07 18:56:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666197348] [2024-11-07 18:56:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:43,463 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 18:56:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:43,467 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 18:56:43,468 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 18:56:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:43,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:56:43,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:43,583 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 18:56:43,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:43,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666197348] [2024-11-07 18:56:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666197348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:43,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:43,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023634014] [2024-11-07 18:56:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:43,584 INFO L87 Difference]: Start difference. First operand 3202 states and 5419 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 18:56:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:43,625 INFO L93 Difference]: Finished difference Result 3142 states and 5333 transitions. [2024-11-07 18:56:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-07 18:56:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:43,642 INFO L225 Difference]: With dead ends: 3142 [2024-11-07 18:56:43,643 INFO L226 Difference]: Without dead ends: 3142 [2024-11-07 18:56:43,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 18:56:43,643 INFO L432 NwaCegarLoop]: 2982 mSDtfsCounter, 71 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5901 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:43,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5901 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:56:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-07 18:56:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2024-11-07 18:56:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 1718 states have (on average 1.9353899883585564) internal successors, (3325), 3135 states have internal predecessors, (3325), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 5333 transitions. [2024-11-07 18:56:43,880 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 5333 transitions. Word has length 13 [2024-11-07 18:56:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:43,881 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 5333 transitions. [2024-11-07 18:56:43,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 18:56:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 5333 transitions. [2024-11-07 18:56:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 18:56:43,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:43,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:43,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 18:56:44,083 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 18:56:44,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:44,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -133316320, now seen corresponding path program 1 times [2024-11-07 18:56:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:44,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856714664] [2024-11-07 18:56:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:44,085 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 18:56:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:44,087 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 18:56:44,090 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 18:56:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:44,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:56:44,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:44,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:56:44,242 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:56:44,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-07 18:56:44,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:56:44,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-07 18:56:44,307 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 18:56:44,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:44,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856714664] [2024-11-07 18:56:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856714664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:56:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954773557] [2024-11-07 18:56:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:44,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:44,310 INFO L87 Difference]: Start difference. First operand 3142 states and 5333 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 18:56:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:45,688 INFO L93 Difference]: Finished difference Result 5952 states and 10146 transitions. [2024-11-07 18:56:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:56:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-07 18:56:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:45,709 INFO L225 Difference]: With dead ends: 5952 [2024-11-07 18:56:45,709 INFO L226 Difference]: Without dead ends: 5952 [2024-11-07 18:56:45,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:56:45,710 INFO L432 NwaCegarLoop]: 3446 mSDtfsCounter, 1924 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 9352 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:45,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 9352 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:56:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-07 18:56:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3141. [2024-11-07 18:56:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 1717 states have (on average 1.9353523587652883) internal successors, (3323), 3134 states have internal predecessors, (3323), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5331 transitions. [2024-11-07 18:56:46,089 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5331 transitions. Word has length 14 [2024-11-07 18:56:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5331 transitions. [2024-11-07 18:56:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 18:56:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5331 transitions. [2024-11-07 18:56:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 18:56:46,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:46,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:56:46,095 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 18:56:46,290 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 18:56:46,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-07 18:56:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467851421] [2024-11-07 18:56:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:46,292 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 18:56:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:46,294 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 18:56:46,297 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 18:56:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:46,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:56:46,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:46,456 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 18:56:46,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:46,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467851421] [2024-11-07 18:56:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467851421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545621851] [2024-11-07 18:56:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:46,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:56:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:56:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:56:46,460 INFO L87 Difference]: Start difference. First operand 3141 states and 5331 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:56:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:46,500 INFO L93 Difference]: Finished difference Result 3081 states and 5245 transitions. [2024-11-07 18:56:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:56:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-07 18:56:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:46,509 INFO L225 Difference]: With dead ends: 3081 [2024-11-07 18:56:46,509 INFO L226 Difference]: Without dead ends: 3081 [2024-11-07 18:56:46,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 18:56:46,510 INFO L432 NwaCegarLoop]: 2939 mSDtfsCounter, 71 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5815 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:46,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5815 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:56:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-11-07 18:56:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3081. [2024-11-07 18:56:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 1681 states have (on average 1.925639500297442) internal successors, (3237), 3074 states have internal predecessors, (3237), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5245 transitions. [2024-11-07 18:56:46,703 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5245 transitions. Word has length 18 [2024-11-07 18:56:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:46,703 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5245 transitions. [2024-11-07 18:56:46,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18:56:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5245 transitions. [2024-11-07 18:56:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 18:56:46,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:46,704 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] [2024-11-07 18:56:46,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 18:56:46,904 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 18:56:46,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:46,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-07 18:56:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510074577] [2024-11-07 18:56:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:46,905 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 18:56:46,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:46,907 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 18:56:46,908 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 18:56:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:47,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:56:47,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:47,078 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 18:56:47,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:47,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510074577] [2024-11-07 18:56:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510074577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:56:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746517887] [2024-11-07 18:56:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:47,080 INFO L87 Difference]: Start difference. First operand 3081 states and 5245 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 18:56:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:47,171 INFO L93 Difference]: Finished difference Result 3051 states and 5187 transitions. [2024-11-07 18:56:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:56:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-07 18:56:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:47,181 INFO L225 Difference]: With dead ends: 3051 [2024-11-07 18:56:47,182 INFO L226 Difference]: Without dead ends: 3051 [2024-11-07 18:56:47,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 18:56:47,183 INFO L432 NwaCegarLoop]: 2894 mSDtfsCounter, 48 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8656 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:47,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8656 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:56:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-11-07 18:56:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2024-11-07 18:56:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 1665 states have (on average 1.9093093093093092) internal successors, (3179), 3044 states have internal predecessors, (3179), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 5187 transitions. [2024-11-07 18:56:47,395 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 5187 transitions. Word has length 20 [2024-11-07 18:56:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:47,395 INFO L471 AbstractCegarLoop]: Abstraction has 3051 states and 5187 transitions. [2024-11-07 18:56:47,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 18:56:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 5187 transitions. [2024-11-07 18:56:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 18:56:47,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:47,396 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] [2024-11-07 18:56:47,401 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 (11)] Ended with exit code 0 [2024-11-07 18:56:47,600 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 18:56:47,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-07 18:56:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095257224] [2024-11-07 18:56:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:47,602 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 18:56:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:47,603 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 18:56:47,604 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 18:56:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:47,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:56:47,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:47,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:47,820 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 18:56:47,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:47,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:47,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095257224] [2024-11-07 18:56:47,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095257224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:47,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:47,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:47,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275903167] [2024-11-07 18:56:47,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:47,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:47,821 INFO L87 Difference]: Start difference. First operand 3051 states and 5187 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 18:56:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:50,768 INFO L93 Difference]: Finished difference Result 3055 states and 5187 transitions. [2024-11-07 18:56:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:56:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-07 18:56:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:50,777 INFO L225 Difference]: With dead ends: 3055 [2024-11-07 18:56:50,778 INFO L226 Difference]: Without dead ends: 3055 [2024-11-07 18:56:50,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 18:56:50,778 INFO L432 NwaCegarLoop]: 2580 mSDtfsCounter, 1644 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:50,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 4124 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 18:56:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-07 18:56:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3047. [2024-11-07 18:56:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 1665 states have (on average 1.9045045045045046) internal successors, (3171), 3040 states have internal predecessors, (3171), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 5179 transitions. [2024-11-07 18:56:50,992 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 5179 transitions. Word has length 34 [2024-11-07 18:56:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 5179 transitions. [2024-11-07 18:56:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 18:56:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 5179 transitions. [2024-11-07 18:56:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 18:56:50,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:50,995 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] [2024-11-07 18:56:51,001 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 18:56:51,196 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 18:56:51,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:51,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-07 18:56:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655008646] [2024-11-07 18:56:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:51,198 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 18:56:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:51,201 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 18:56:51,204 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 18:56:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:51,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:56:51,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:51,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:56:51,498 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 18:56:51,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:51,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655008646] [2024-11-07 18:56:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655008646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863494041] [2024-11-07 18:56:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:51,499 INFO L87 Difference]: Start difference. First operand 3047 states and 5179 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 18:56:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:54,943 INFO L93 Difference]: Finished difference Result 5346 states and 9500 transitions. [2024-11-07 18:56:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:56:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-07 18:56:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:54,960 INFO L225 Difference]: With dead ends: 5346 [2024-11-07 18:56:54,960 INFO L226 Difference]: Without dead ends: 5346 [2024-11-07 18:56:54,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 18:56:54,961 INFO L432 NwaCegarLoop]: 4937 mSDtfsCounter, 1391 mSDsluCounter, 5926 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 10863 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:54,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 10863 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-07 18:56:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2024-11-07 18:56:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 3043. [2024-11-07 18:56:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 1665 states have (on average 1.8996996996996998) internal successors, (3163), 3036 states have internal predecessors, (3163), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 5171 transitions. [2024-11-07 18:56:55,347 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 5171 transitions. Word has length 34 [2024-11-07 18:56:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:55,347 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 5171 transitions. [2024-11-07 18:56:55,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 18:56:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 5171 transitions. [2024-11-07 18:56:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 18:56:55,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:55,349 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] [2024-11-07 18:56:55,357 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 (13)] Forceful destruction successful, exit code 0 [2024-11-07 18:56:55,550 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 18:56:55,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:55,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-07 18:56:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057221571] [2024-11-07 18:56:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:55,552 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 18:56:55,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:55,556 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 18:56:55,557 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 18:56:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:55,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:56:55,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:55,801 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 18:56:55,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:55,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:55,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057221571] [2024-11-07 18:56:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057221571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:56:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778277743] [2024-11-07 18:56:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:55,803 INFO L87 Difference]: Start difference. First operand 3043 states and 5171 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 18:56:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:55,860 INFO L93 Difference]: Finished difference Result 3031 states and 5151 transitions. [2024-11-07 18:56:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:56:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-07 18:56:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:55,873 INFO L225 Difference]: With dead ends: 3031 [2024-11-07 18:56:55,873 INFO L226 Difference]: Without dead ends: 3031 [2024-11-07 18:56:55,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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 18:56:55,874 INFO L432 NwaCegarLoop]: 2888 mSDtfsCounter, 21 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8633 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:55,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8633 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:56:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2024-11-07 18:56:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3031. [2024-11-07 18:56:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 1653 states have (on average 1.9013914095583786) internal successors, (3143), 3024 states have internal predecessors, (3143), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5151 transitions. [2024-11-07 18:56:56,148 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5151 transitions. Word has length 53 [2024-11-07 18:56:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:56,150 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5151 transitions. [2024-11-07 18:56:56,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 18:56:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5151 transitions. [2024-11-07 18:56:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 18:56:56,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:56,153 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] [2024-11-07 18:56:56,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 18:56:56,353 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 18:56:56,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:56,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-07 18:56:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:56,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563552631] [2024-11-07 18:56:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:56,355 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 18:56:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:56,357 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 18:56:56,358 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 18:56:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:56,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:56:56,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:56,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:56,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:56:57,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:56:57,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 18:56:57,066 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:56:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 18:56:57,079 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 18:56:57,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:57,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:57,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563552631] [2024-11-07 18:56:57,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563552631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:57,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:57,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:56:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911193047] [2024-11-07 18:56:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:56:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:56:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:57,082 INFO L87 Difference]: Start difference. First operand 3031 states and 5151 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 18:56:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:56:59,103 INFO L93 Difference]: Finished difference Result 2993 states and 5113 transitions. [2024-11-07 18:56:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:56:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-07 18:56:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:56:59,113 INFO L225 Difference]: With dead ends: 2993 [2024-11-07 18:56:59,114 INFO L226 Difference]: Without dead ends: 2993 [2024-11-07 18:56:59,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:56:59,114 INFO L432 NwaCegarLoop]: 2459 mSDtfsCounter, 1570 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:56:59,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 2641 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 18:56:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-11-07 18:56:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2956. [2024-11-07 18:56:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 1616 states have (on average 1.875618811881188) internal successors, (3031), 2949 states have internal predecessors, (3031), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:56:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 5039 transitions. [2024-11-07 18:56:59,340 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 5039 transitions. Word has length 61 [2024-11-07 18:56:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:56:59,341 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 5039 transitions. [2024-11-07 18:56:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 18:56:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 5039 transitions. [2024-11-07 18:56:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 18:56:59,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:56:59,342 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] [2024-11-07 18:56:59,352 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 (15)] Ended with exit code 0 [2024-11-07 18:56:59,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:56:59,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:56:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:56:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-07 18:56:59,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:56:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408952113] [2024-11-07 18:56:59,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:56:59,545 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 18:56:59,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:56:59,547 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:56:59,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 18:56:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:56:59,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 18:56:59,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:56:59,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:56:59,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:56:59,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 18:56:59,876 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 18:56:59,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:56:59,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:56:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408952113] [2024-11-07 18:56:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408952113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:56:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:56:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:56:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81760206] [2024-11-07 18:56:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:56:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:56:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:56:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:56:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:56:59,878 INFO L87 Difference]: Start difference. First operand 2956 states and 5039 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 18:57:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:01,412 INFO L93 Difference]: Finished difference Result 2955 states and 5038 transitions. [2024-11-07 18:57:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:57:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-07 18:57:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:01,421 INFO L225 Difference]: With dead ends: 2955 [2024-11-07 18:57:01,421 INFO L226 Difference]: Without dead ends: 2955 [2024-11-07 18:57:01,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:57:01,421 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 2 mSDsluCounter, 7372 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:01,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10233 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:57:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-11-07 18:57:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2024-11-07 18:57:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 1616 states have (on average 1.875) internal successors, (3030), 2948 states have internal predecessors, (3030), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:57:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 5038 transitions. [2024-11-07 18:57:01,646 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 5038 transitions. Word has length 66 [2024-11-07 18:57:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 5038 transitions. [2024-11-07 18:57:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 18:57:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 5038 transitions. [2024-11-07 18:57:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 18:57:01,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:01,649 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] [2024-11-07 18:57:01,660 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 (16)] Forceful destruction successful, exit code 0 [2024-11-07 18:57:01,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:01,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:01,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:01,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-07 18:57:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:01,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135618808] [2024-11-07 18:57:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:57:01,852 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 18:57:01,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:01,855 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:01,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 18:57:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:57:02,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 18:57:02,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:02,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:57:02,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 18:57:02,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:57:02,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 18:57:02,237 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 18:57:02,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:57:02,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135618808] [2024-11-07 18:57:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135618808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:57:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:57:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:57:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933052619] [2024-11-07 18:57:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:57:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:57:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:57:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:57:02,239 INFO L87 Difference]: Start difference. First operand 2955 states and 5038 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 18:57:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:03,947 INFO L93 Difference]: Finished difference Result 2954 states and 5037 transitions. [2024-11-07 18:57:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:57:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-07 18:57:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:03,954 INFO L225 Difference]: With dead ends: 2954 [2024-11-07 18:57:03,954 INFO L226 Difference]: Without dead ends: 2954 [2024-11-07 18:57:03,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:57:03,955 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 1 mSDsluCounter, 7405 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10266 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10266 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 18:57:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-07 18:57:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2954. [2024-11-07 18:57:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 1615 states have (on average 1.8755417956656346) internal successors, (3029), 2947 states have internal predecessors, (3029), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-07 18:57:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 5037 transitions. [2024-11-07 18:57:04,170 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 5037 transitions. Word has length 66 [2024-11-07 18:57:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:04,170 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 5037 transitions. [2024-11-07 18:57:04,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 18:57:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 5037 transitions. [2024-11-07 18:57:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 18:57:04,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:04,171 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] [2024-11-07 18:57:04,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-07 18:57:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:04,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -620255098, now seen corresponding path program 1 times [2024-11-07 18:57:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373371449] [2024-11-07 18:57:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:57:04,379 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 18:57:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:04,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:04,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 18:57:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:57:04,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:57:04,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:04,683 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 18:57:04,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:57:04,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373371449] [2024-11-07 18:57:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373371449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:57:04,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:57:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:57:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218359621] [2024-11-07 18:57:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:57:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:57:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:57:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:57:04,686 INFO L87 Difference]: Start difference. First operand 2954 states and 5037 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:57:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:04,731 INFO L93 Difference]: Finished difference Result 2957 states and 5041 transitions. [2024-11-07 18:57:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:57:04,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-07 18:57:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:04,742 INFO L225 Difference]: With dead ends: 2957 [2024-11-07 18:57:04,742 INFO L226 Difference]: Without dead ends: 2957 [2024-11-07 18:57:04,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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 18:57:04,743 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 0 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8578 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:04,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8578 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:57:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-11-07 18:57:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2024-11-07 18:57:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1617 states have (on average 1.8750773036487323) internal successors, (3032), 2950 states have internal predecessors, (3032), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-07 18:57:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 5041 transitions. [2024-11-07 18:57:04,945 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 5041 transitions. Word has length 74 [2024-11-07 18:57:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:04,945 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 5041 transitions. [2024-11-07 18:57:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:57:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 5041 transitions. [2024-11-07 18:57:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 18:57:04,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:04,946 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] [2024-11-07 18:57:04,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-07 18:57:05,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:05,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:05,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash 537846652, now seen corresponding path program 1 times [2024-11-07 18:57:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865971398] [2024-11-07 18:57:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:57:05,149 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 18:57:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:05,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:05,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-07 18:57:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:57:05,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:57:05,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:05,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:57:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:05,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865971398] [2024-11-07 18:57:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865971398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:57:05,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:57:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 18:57:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311352138] [2024-11-07 18:57:05,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:57:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 18:57:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 18:57:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:57:05,507 INFO L87 Difference]: Start difference. First operand 2957 states and 5041 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:05,625 INFO L93 Difference]: Finished difference Result 2969 states and 5058 transitions. [2024-11-07 18:57:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:57:05,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-07 18:57:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:05,638 INFO L225 Difference]: With dead ends: 2969 [2024-11-07 18:57:05,638 INFO L226 Difference]: Without dead ends: 2969 [2024-11-07 18:57:05,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 18:57:05,639 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 5 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14291 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:05,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14291 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:57:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2024-11-07 18:57:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2024-11-07 18:57:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 1626 states have (on average 1.8739237392373924) internal successors, (3047), 2959 states have internal predecessors, (3047), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-07 18:57:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 5056 transitions. [2024-11-07 18:57:05,900 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 5056 transitions. Word has length 75 [2024-11-07 18:57:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:05,900 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 5056 transitions. [2024-11-07 18:57:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 5056 transitions. [2024-11-07 18:57:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 18:57:05,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:05,901 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:05,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 18:57:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:06,101 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2139507194, now seen corresponding path program 2 times [2024-11-07 18:57:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096661751] [2024-11-07 18:57:06,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 18:57:06,102 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 18:57:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:06,105 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:06,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 18:57:06,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 18:57:06,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:57:06,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 18:57:06,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:06,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:57:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:06,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096661751] [2024-11-07 18:57:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096661751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:57:06,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:57:06,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 18:57:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658977432] [2024-11-07 18:57:06,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:57:06,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:57:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:57:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:57:06,740 INFO L87 Difference]: Start difference. First operand 2967 states and 5056 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:07,165 INFO L93 Difference]: Finished difference Result 2982 states and 5078 transitions. [2024-11-07 18:57:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 18:57:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-07 18:57:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:07,182 INFO L225 Difference]: With dead ends: 2982 [2024-11-07 18:57:07,182 INFO L226 Difference]: Without dead ends: 2978 [2024-11-07 18:57:07,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 18:57:07,183 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 11 mSDsluCounter, 17150 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20011 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:07,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20011 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 18:57:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-11-07 18:57:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2024-11-07 18:57:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 1635 states have (on average 1.8709480122324158) internal successors, (3059), 2968 states have internal predecessors, (3059), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-07 18:57:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5068 transitions. [2024-11-07 18:57:07,383 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5068 transitions. Word has length 78 [2024-11-07 18:57:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5068 transitions. [2024-11-07 18:57:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5068 transitions. [2024-11-07 18:57:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 18:57:07,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:07,384 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:07,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 18:57:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:07,585 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:07,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash -114974138, now seen corresponding path program 3 times [2024-11-07 18:57:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306893757] [2024-11-07 18:57:07,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 18:57:07,587 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 18:57:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:07,588 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:07,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 18:57:08,187 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-07 18:57:08,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:57:08,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 18:57:08,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:08,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:57:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:08,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:08,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306893757] [2024-11-07 18:57:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306893757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:57:08,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:57:08,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 18:57:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913843332] [2024-11-07 18:57:08,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:57:08,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 18:57:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 18:57:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 18:57:08,779 INFO L87 Difference]: Start difference. First operand 2976 states and 5068 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:10,151 INFO L93 Difference]: Finished difference Result 3000 states and 5107 transitions. [2024-11-07 18:57:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 18:57:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-07 18:57:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:10,163 INFO L225 Difference]: With dead ends: 3000 [2024-11-07 18:57:10,163 INFO L226 Difference]: Without dead ends: 2994 [2024-11-07 18:57:10,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 18:57:10,167 INFO L432 NwaCegarLoop]: 2862 mSDtfsCounter, 23 mSDsluCounter, 34307 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37169 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:10,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37169 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 18:57:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-11-07 18:57:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2994. [2024-11-07 18:57:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 1653 states have (on average 1.8644888082274653) internal successors, (3082), 2986 states have internal predecessors, (3082), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-07 18:57:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 5091 transitions. [2024-11-07 18:57:10,420 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 5091 transitions. Word has length 84 [2024-11-07 18:57:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:10,421 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 5091 transitions. [2024-11-07 18:57:10,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 5091 transitions. [2024-11-07 18:57:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 18:57:10,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:10,422 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:10,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 18:57:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:10,623 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1196758330, now seen corresponding path program 4 times [2024-11-07 18:57:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900619219] [2024-11-07 18:57:10,625 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 18:57:10,625 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 18:57:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:10,627 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:10,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 18:57:11,065 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 18:57:11,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:57:11,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 18:57:11,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:11,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:57:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:57:12,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900619219] [2024-11-07 18:57:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900619219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:57:12,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:57:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 18:57:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86940440] [2024-11-07 18:57:12,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:57:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 18:57:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:57:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 18:57:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 18:57:12,453 INFO L87 Difference]: Start difference. First operand 2994 states and 5091 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:57:16,816 INFO L93 Difference]: Finished difference Result 3034 states and 5163 transitions. [2024-11-07 18:57:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 18:57:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-07 18:57:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:57:16,830 INFO L225 Difference]: With dead ends: 3034 [2024-11-07 18:57:16,830 INFO L226 Difference]: Without dead ends: 3030 [2024-11-07 18:57:16,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 18:57:16,833 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 47 mSDsluCounter, 74305 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77166 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:57:16,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 77166 Invalid, 2003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 18:57:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-07 18:57:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3028. [2024-11-07 18:57:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1687 states have (on average 1.8541790160047422) internal successors, (3128), 3020 states have internal predecessors, (3128), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-07 18:57:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5137 transitions. [2024-11-07 18:57:17,104 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5137 transitions. Word has length 96 [2024-11-07 18:57:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:57:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5137 transitions. [2024-11-07 18:57:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:57:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5137 transitions. [2024-11-07 18:57:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 18:57:17,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:57:17,105 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:57:17,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 18:57:17,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:57:17,306 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-07 18:57:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:57:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1074332410, now seen corresponding path program 5 times [2024-11-07 18:57:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:57:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562078625] [2024-11-07 18:57:17,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:57:17,307 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 18:57:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:57:17,309 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:57:17,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-07 18:57:18,325 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-07 18:57:18,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:57:18,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-07 18:57:18,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:57:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:57:18,443 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-07 18:57:18,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-07 18:57:18,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:57:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 18:57:19,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:57:19,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-07 18:57:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-07 18:57:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 18:57:19,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:57:19,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-07 18:57:19,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:57:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562078625] [2024-11-07 18:57:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562078625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:57:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514569179] [2024-11-07 18:57:19,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:57:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 18:57:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 18:57:19,566 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 18:57:19,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process