./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:15:04,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:15:04,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:15:04,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:15:04,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:15:04,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:15:04,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:15:04,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:15:04,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:15:04,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:15:04,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:15:04,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:15:04,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:15:04,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:15:04,719 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:15:04,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:15:04,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:15:04,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:15:04,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:15:04,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:15:04,721 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:15:04,727 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:15:04,727 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:15:04,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:15:04,727 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:15:04,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:15:04,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:15:04,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:15:04,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:15:04,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:15:04,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:15:04,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:15:04,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:15:04,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:15:04,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:15:04,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:15:04,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:15:04,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:15:04,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:15:04,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:15:04,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:15:04,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:15:04,738 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2024-11-19 09:15:05,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:15:05,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:15:05,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:15:05,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:15:05,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:15:05,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-11-19 09:15:06,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:15:06,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:15:06,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-11-19 09:15:06,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2509a8a/9966c91d4f2f46d6aa3d57f439f9ec07/FLAGa6e08f176 [2024-11-19 09:15:07,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2509a8a/9966c91d4f2f46d6aa3d57f439f9ec07 [2024-11-19 09:15:07,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:15:07,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:15:07,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:07,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:15:07,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:15:07,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:07" (1/1) ... [2024-11-19 09:15:07,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394cbf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:07, skipping insertion in model container [2024-11-19 09:15:07,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:07" (1/1) ... [2024-11-19 09:15:07,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:15:07,781 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-19 09:15:07,825 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-19 09:15:07,830 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-19 09:15:07,836 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-19 09:15:07,848 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:07,898 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-19 09:15:07,900 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-19 09:15:07,902 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-19 09:15:07,906 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-19 09:15:07,948 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-19 09:15:07,949 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-19 09:15:07,954 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-19 09:15:07,954 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-19 09:15:07,974 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-19 09:15:07,975 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-19 09:15:07,977 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-19 09:15:07,977 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-19 09:15:07,988 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-19 09:15:07,988 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-19 09:15:07,990 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-19 09:15:07,991 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-19 09:15:08,001 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-19 09:15:08,001 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-19 09:15:08,003 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-19 09:15:08,004 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-19 09:15:08,006 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-19 09:15:08,007 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-19 09:15:08,009 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-19 09:15:08,010 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-19 09:15:08,011 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-19 09:15:08,014 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-19 09:15:08,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:08,049 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-19 09:15:08,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c8d9ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:08, skipping insertion in model container [2024-11-19 09:15:08,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:08,051 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:15:08,054 INFO L158 Benchmark]: Toolchain (without parser) took 925.41ms. Allocated memory is still 176.2MB. Free memory was 119.8MB in the beginning and 85.1MB in the end (delta: 34.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 09:15:08,054 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:15:08,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 922.12ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 85.1MB in the end (delta: 34.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 09:15:08,056 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.24ms. Allocated memory is still 176.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 922.12ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 85.1MB in the end (delta: 34.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:15:10,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:15:10,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:15:10,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:15:10,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:15:10,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:15:10,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:15:10,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:15:10,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:15:10,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:15:10,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:15:10,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:15:10,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:15:10,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:15:10,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:15:10,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:15:10,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:15:10,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:15:10,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:15:10,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:15:10,297 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:15:10,297 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:15:10,297 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:15:10,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:15:10,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:15:10,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:15:10,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:15:10,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:15:10,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:15:10,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:15:10,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:15:10,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:15:10,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:15:10,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:15:10,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:15:10,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:15:10,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:15:10,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:15:10,309 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:15:10,309 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:15:10,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:15:10,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:15:10,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:15:10,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:15:10,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 9a343b75818c5d561b79c31bb62e9abdd9bdb0bf3f01f7efa313d9ef0f4204f4 [2024-11-19 09:15:10,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:15:10,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:15:10,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:15:10,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:15:10,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:15:10,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-11-19 09:15:12,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:15:12,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:15:12,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-2.i [2024-11-19 09:15:12,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526db6fb8/30bd1a33709b49b48833de4015bd2efe/FLAGa45f448e1 [2024-11-19 09:15:12,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526db6fb8/30bd1a33709b49b48833de4015bd2efe [2024-11-19 09:15:12,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:15:12,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:15:12,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:12,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:15:12,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:15:12,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:12" (1/1) ... [2024-11-19 09:15:12,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9e2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:12, skipping insertion in model container [2024-11-19 09:15:12,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:12" (1/1) ... [2024-11-19 09:15:12,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:15:13,215 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-19 09:15:13,253 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-19 09:15:13,261 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-19 09:15:13,270 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-19 09:15:13,280 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-19 09:15:13,346 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,348 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-19 09:15:13,352 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-19 09:15:13,358 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-19 09:15:13,398 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-19 09:15:13,398 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-19 09:15:13,400 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-19 09:15:13,400 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-19 09:15:13,425 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-19 09:15:13,429 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,432 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-19 09:15:13,448 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-19 09:15:13,450 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-19 09:15:13,452 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-19 09:15:13,454 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-19 09:15:13,468 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-19 09:15:13,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,479 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,481 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,482 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-19 09:15:13,483 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-19 09:15:13,488 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-19 09:15:13,489 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:13,491 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-19 09:15:13,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:13,531 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:15:13,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:15:13,576 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-19 09:15:13,589 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-19 09:15:13,604 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-19 09:15:13,607 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-19 09:15:13,612 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-19 09:15:13,625 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-19 09:15:13,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-19 09:15:13,628 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-19 09:15:13,630 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-19 09:15:13,639 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-19 09:15:13,640 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-19 09:15:13,641 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-19 09:15:13,642 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-19 09:15:13,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-19 09:15:13,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-19 09:15:13,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-19 09:15:13,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-19 09:15:13,657 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-19 09:15:13,657 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-19 09:15:13,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-19 09:15:13,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-19 09:15:13,666 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-19 09:15:13,666 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-19 09:15:13,669 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-19 09:15:13,669 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-19 09:15:13,670 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-19 09:15:13,671 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-19 09:15:13,672 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-19 09:15:13,672 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-19 09:15:13,673 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-19 09:15:13,674 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-19 09:15:13,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:13,683 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:15:13,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:13,870 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:15:13,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13 WrapperNode [2024-11-19 09:15:13,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:13,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:15:13,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:15:13,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:15:13,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:13,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,029 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-11-19 09:15:14,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:15:14,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:15:14,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:15:14,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:15:14,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,213 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 420, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 90, 4]. [2024-11-19 09:15:14,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:15:14,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:15:14,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:15:14,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:15:14,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (1/1) ... [2024-11-19 09:15:14,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:15:14,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:14,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:15:14,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:15:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:15:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:15:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:15:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-19 09:15:14,482 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-19 09:15:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:15:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:15:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:15:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:15:14,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:15:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:15:14,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:14,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:14,484 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:15:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:15:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:15:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:15:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:15:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:15:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:15:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:15:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:15:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:15:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:15:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:15:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:15:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:15:14,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:15:14,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:15:14,854 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:14,880 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:14,931 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:22,899 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-11-19 09:15:22,899 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:15:22,961 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:15:22,962 INFO L316 CfgBuilder]: Removed 160 assume(true) statements. [2024-11-19 09:15:22,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:22 BoogieIcfgContainer [2024-11-19 09:15:22,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:15:22,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:15:22,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:15:22,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:15:22,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:12" (1/3) ... [2024-11-19 09:15:22,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb8a0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:22, skipping insertion in model container [2024-11-19 09:15:22,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:13" (2/3) ... [2024-11-19 09:15:22,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb8a0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:22, skipping insertion in model container [2024-11-19 09:15:22,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:22" (3/3) ... [2024-11-19 09:15:22,972 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-2.i [2024-11-19 09:15:22,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:15:22,992 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-11-19 09:15:23,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:15:23,099 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;@87a7025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:15:23,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-11-19 09:15:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 2277 states, 1174 states have (on average 2.1873935264054514) internal successors, (2568), 2263 states have internal predecessors, (2568), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 09:15:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:15:23,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:23,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:15:23,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:23,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-19 09:15:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180200663] [2024-11-19 09:15:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:23,137 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-19 09:15:23,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:23,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-19 09:15:23,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:23,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:23,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:23,400 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-19 09:15:23,417 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-19 09:15:23,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:23,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180200663] [2024-11-19 09:15:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180200663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589962027] [2024-11-19 09:15:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:23,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:23,545 INFO L87 Difference]: Start difference. First operand has 2277 states, 1174 states have (on average 2.1873935264054514) internal successors, (2568), 2263 states have internal predecessors, (2568), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-19 09:15:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:27,174 INFO L93 Difference]: Finished difference Result 2941 states and 3125 transitions. [2024-11-19 09:15:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:27,176 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-19 09:15:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:27,205 INFO L225 Difference]: With dead ends: 2941 [2024-11-19 09:15:27,205 INFO L226 Difference]: Without dead ends: 2939 [2024-11-19 09:15:27,207 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-19 09:15:27,213 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 2142 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:27,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1880 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 09:15:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2024-11-19 09:15:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2421. [2024-11-19 09:15:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 1346 states have (on average 2.0222882615156017) internal successors, (2722), 2405 states have internal predecessors, (2722), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:15:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 2754 transitions. [2024-11-19 09:15:27,351 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 2754 transitions. Word has length 3 [2024-11-19 09:15:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 2754 transitions. [2024-11-19 09:15:27,352 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-19 09:15:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2754 transitions. [2024-11-19 09:15:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:15:27,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:27,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:15:27,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:27,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-19 09:15:27,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-19 09:15:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591162] [2024-11-19 09:15:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:27,559 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-19 09:15:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:27,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-19 09:15:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:27,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:27,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:27,737 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-19 09:15:27,750 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-19 09:15:27,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:27,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591162] [2024-11-19 09:15:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768228835] [2024-11-19 09:15:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:27,754 INFO L87 Difference]: Start difference. First operand 2421 states and 2754 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-19 09:15:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:32,339 INFO L93 Difference]: Finished difference Result 3222 states and 3635 transitions. [2024-11-19 09:15:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:32,339 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-19 09:15:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:32,352 INFO L225 Difference]: With dead ends: 3222 [2024-11-19 09:15:32,352 INFO L226 Difference]: Without dead ends: 3222 [2024-11-19 09:15:32,352 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-19 09:15:32,354 INFO L432 NwaCegarLoop]: 2039 mSDtfsCounter, 875 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:32,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3347 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 09:15:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2024-11-19 09:15:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2894. [2024-11-19 09:15:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 1817 states have (on average 1.9796367638965326) internal successors, (3597), 2875 states have internal predecessors, (3597), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 09:15:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3635 transitions. [2024-11-19 09:15:32,448 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3635 transitions. Word has length 3 [2024-11-19 09:15:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:32,449 INFO L471 AbstractCegarLoop]: Abstraction has 2894 states and 3635 transitions. [2024-11-19 09:15:32,450 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-19 09:15:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3635 transitions. [2024-11-19 09:15:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:15:32,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:32,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:32,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-19 09:15:32,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 703308354, now seen corresponding path program 1 times [2024-11-19 09:15:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:32,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035257010] [2024-11-19 09:15:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:32,656 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-19 09:15:32,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:32,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-19 09:15:32,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:32,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:15:32,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:32,881 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-19 09:15:32,889 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-19 09:15:32,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:15:32,957 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-19 09:15:32,978 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:15:32,979 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-19 09:15:33,011 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-19 09:15:33,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:33,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:33,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035257010] [2024-11-19 09:15:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035257010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784365334] [2024-11-19 09:15:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:33,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:33,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:33,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:33,015 INFO L87 Difference]: Start difference. First operand 2894 states and 3635 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-19 09:15:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:40,016 INFO L93 Difference]: Finished difference Result 5159 states and 6050 transitions. [2024-11-19 09:15:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:40,018 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-19 09:15:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:40,034 INFO L225 Difference]: With dead ends: 5159 [2024-11-19 09:15:40,035 INFO L226 Difference]: Without dead ends: 5159 [2024-11-19 09:15:40,036 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-19 09:15:40,037 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 4330 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4339 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:40,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4339 Valid, 2423 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-19 09:15:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2024-11-19 09:15:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 3614. [2024-11-19 09:15:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 2537 states have (on average 2.011430823807647) internal successors, (5103), 3589 states have internal predecessors, (5103), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5153 transitions. [2024-11-19 09:15:40,128 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5153 transitions. Word has length 7 [2024-11-19 09:15:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:40,130 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 5153 transitions. [2024-11-19 09:15:40,131 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-19 09:15:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5153 transitions. [2024-11-19 09:15:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:15:40,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:40,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:40,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-19 09:15:40,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-19 09:15:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:40,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409045656] [2024-11-19 09:15:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:40,334 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-19 09:15:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:40,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-19 09:15:40,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:40,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:40,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:40,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:40,523 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-19 09:15:40,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:40,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409045656] [2024-11-19 09:15:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409045656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:40,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291550041] [2024-11-19 09:15:40,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:40,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:40,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:40,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:40,525 INFO L87 Difference]: Start difference. First operand 3614 states and 5153 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-19 09:15:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:43,491 INFO L93 Difference]: Finished difference Result 4326 states and 5823 transitions. [2024-11-19 09:15:43,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:43,492 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-19 09:15:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:43,509 INFO L225 Difference]: With dead ends: 4326 [2024-11-19 09:15:43,509 INFO L226 Difference]: Without dead ends: 4326 [2024-11-19 09:15:43,510 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-19 09:15:43,511 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 1920 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:43,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 2901 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 09:15:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2024-11-19 09:15:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 3522. [2024-11-19 09:15:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 2537 states have (on average 1.9266850610957824) internal successors, (4888), 3497 states have internal predecessors, (4888), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4938 transitions. [2024-11-19 09:15:43,586 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4938 transitions. Word has length 8 [2024-11-19 09:15:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:43,587 INFO L471 AbstractCegarLoop]: Abstraction has 3522 states and 4938 transitions. [2024-11-19 09:15:43,587 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-19 09:15:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4938 transitions. [2024-11-19 09:15:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:15:43,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:43,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:43,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-19 09:15:43,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-19 09:15:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832106888] [2024-11-19 09:15:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:43,789 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-19 09:15:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:43,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-19 09:15:43,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:43,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:43,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:43,980 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-19 09:15:44,002 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-19 09:15:44,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:44,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832106888] [2024-11-19 09:15:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832106888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348896452] [2024-11-19 09:15:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:44,004 INFO L87 Difference]: Start difference. First operand 3522 states and 4938 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-19 09:15:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:48,009 INFO L93 Difference]: Finished difference Result 5327 states and 7398 transitions. [2024-11-19 09:15:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:48,009 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-19 09:15:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:48,023 INFO L225 Difference]: With dead ends: 5327 [2024-11-19 09:15:48,023 INFO L226 Difference]: Without dead ends: 5327 [2024-11-19 09:15:48,023 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-19 09:15:48,024 INFO L432 NwaCegarLoop]: 2577 mSDtfsCounter, 1423 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:48,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3684 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 09:15:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2024-11-19 09:15:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 3866. [2024-11-19 09:15:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 2891 states have (on average 1.9121411276374958) internal successors, (5528), 3841 states have internal predecessors, (5528), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5578 transitions. [2024-11-19 09:15:48,100 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5578 transitions. Word has length 8 [2024-11-19 09:15:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5578 transitions. [2024-11-19 09:15:48,100 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-19 09:15:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5578 transitions. [2024-11-19 09:15:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:15:48,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:48,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:48,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:48,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-19 09:15:48,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:48,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash -582246585, now seen corresponding path program 1 times [2024-11-19 09:15:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:48,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040053386] [2024-11-19 09:15:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:48,303 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-19 09:15:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:48,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-19 09:15:48,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:48,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:15:48,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:48,493 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-19 09:15:48,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:48,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040053386] [2024-11-19 09:15:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040053386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:48,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418148662] [2024-11-19 09:15:48,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:48,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:48,496 INFO L87 Difference]: Start difference. First operand 3866 states and 5578 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-19 09:15:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:48,547 INFO L93 Difference]: Finished difference Result 3806 states and 5492 transitions. [2024-11-19 09:15:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:48,548 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-19 09:15:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:48,566 INFO L225 Difference]: With dead ends: 3806 [2024-11-19 09:15:48,566 INFO L226 Difference]: Without dead ends: 3806 [2024-11-19 09:15:48,567 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-19 09:15:48,567 INFO L432 NwaCegarLoop]: 2231 mSDtfsCounter, 71 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4399 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-19 09:15:48,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2024-11-19 09:15:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3806. [2024-11-19 09:15:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 2855 states have (on average 1.9061295971978984) internal successors, (5442), 3781 states have internal predecessors, (5442), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 5492 transitions. [2024-11-19 09:15:48,640 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 5492 transitions. Word has length 11 [2024-11-19 09:15:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 5492 transitions. [2024-11-19 09:15:48,640 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-19 09:15:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 5492 transitions. [2024-11-19 09:15:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:15:48,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:48,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:48,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:48,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-19 09:15:48,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1193166111, now seen corresponding path program 1 times [2024-11-19 09:15:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465399847] [2024-11-19 09:15:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:48,846 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-19 09:15:48,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:48,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-19 09:15:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:49,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:49,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:49,036 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-19 09:15:49,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:49,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:49,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465399847] [2024-11-19 09:15:49,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465399847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:49,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512143633] [2024-11-19 09:15:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:49,040 INFO L87 Difference]: Start difference. First operand 3806 states and 5492 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 09:15:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:49,143 INFO L93 Difference]: Finished difference Result 3776 states and 5434 transitions. [2024-11-19 09:15:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 09:15:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:49,172 INFO L225 Difference]: With dead ends: 3776 [2024-11-19 09:15:49,172 INFO L226 Difference]: Without dead ends: 3776 [2024-11-19 09:15:49,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-19 09:15:49,173 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 48 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6532 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:49,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6532 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:15:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-11-19 09:15:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3776. [2024-11-19 09:15:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 2839 states have (on average 1.896442409299049) internal successors, (5384), 3751 states have internal predecessors, (5384), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 5434 transitions. [2024-11-19 09:15:49,237 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 5434 transitions. Word has length 13 [2024-11-19 09:15:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:49,238 INFO L471 AbstractCegarLoop]: Abstraction has 3776 states and 5434 transitions. [2024-11-19 09:15:49,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 09:15:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 5434 transitions. [2024-11-19 09:15:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:15:49,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:49,238 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-19 09:15:49,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-19 09:15:49,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -555227553, now seen corresponding path program 1 times [2024-11-19 09:15:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091300333] [2024-11-19 09:15:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:49,441 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-19 09:15:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:49,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-19 09:15:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:49,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:15:49,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:49,666 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-19 09:15:49,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:49,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091300333] [2024-11-19 09:15:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091300333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:49,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895592189] [2024-11-19 09:15:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:49,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:49,668 INFO L87 Difference]: Start difference. First operand 3776 states and 5434 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:49,721 INFO L93 Difference]: Finished difference Result 3644 states and 5176 transitions. [2024-11-19 09:15:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:49,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:49,735 INFO L225 Difference]: With dead ends: 3644 [2024-11-19 09:15:49,739 INFO L226 Difference]: Without dead ends: 3644 [2024-11-19 09:15:49,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-19 09:15:49,740 INFO L432 NwaCegarLoop]: 2153 mSDtfsCounter, 71 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4243 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-19 09:15:49,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4243 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2024-11-19 09:15:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2024-11-19 09:15:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2731 states have (on average 1.876968143537166) internal successors, (5126), 3619 states have internal predecessors, (5126), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 5176 transitions. [2024-11-19 09:15:49,806 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 5176 transitions. Word has length 20 [2024-11-19 09:15:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:49,806 INFO L471 AbstractCegarLoop]: Abstraction has 3644 states and 5176 transitions. [2024-11-19 09:15:49,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 5176 transitions. [2024-11-19 09:15:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:15:49,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:49,808 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-19 09:15:49,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-19 09:15:50,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-19 09:15:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537883952] [2024-11-19 09:15:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:50,010 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-19 09:15:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:50,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-19 09:15:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:50,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:15:50,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:50,258 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-19 09:15:50,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:50,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537883952] [2024-11-19 09:15:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537883952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040963179] [2024-11-19 09:15:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:50,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:50,260 INFO L87 Difference]: Start difference. First operand 3644 states and 5176 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:50,308 INFO L93 Difference]: Finished difference Result 3584 states and 5090 transitions. [2024-11-19 09:15:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:50,316 INFO L225 Difference]: With dead ends: 3584 [2024-11-19 09:15:50,317 INFO L226 Difference]: Without dead ends: 3584 [2024-11-19 09:15:50,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-19 09:15:50,317 INFO L432 NwaCegarLoop]: 2110 mSDtfsCounter, 71 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4157 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-19 09:15:50,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-11-19 09:15:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3584. [2024-11-19 09:15:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2695 states have (on average 1.87012987012987) internal successors, (5040), 3559 states have internal predecessors, (5040), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5090 transitions. [2024-11-19 09:15:50,382 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5090 transitions. Word has length 20 [2024-11-19 09:15:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:50,382 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5090 transitions. [2024-11-19 09:15:50,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-19 09:15:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5090 transitions. [2024-11-19 09:15:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:15:50,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:50,383 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] [2024-11-19 09:15:50,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-19 09:15:50,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:50,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -997708103, now seen corresponding path program 1 times [2024-11-19 09:15:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473326980] [2024-11-19 09:15:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:50,585 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-19 09:15:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:50,586 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-19 09:15:50,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:50,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:50,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:50,824 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-19 09:15:50,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:50,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473326980] [2024-11-19 09:15:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473326980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833308868] [2024-11-19 09:15:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:50,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:50,826 INFO L87 Difference]: Start difference. First operand 3584 states and 5090 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-19 09:15:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:50,897 INFO L93 Difference]: Finished difference Result 3522 states and 4916 transitions. [2024-11-19 09:15:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:50,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-19 09:15:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:50,907 INFO L225 Difference]: With dead ends: 3522 [2024-11-19 09:15:50,908 INFO L226 Difference]: Without dead ends: 3522 [2024-11-19 09:15:50,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-19 09:15:50,909 INFO L432 NwaCegarLoop]: 2065 mSDtfsCounter, 48 mSDsluCounter, 4104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6169 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-19 09:15:50,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2024-11-19 09:15:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3522. [2024-11-19 09:15:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 2647 states have (on average 1.8383075179448432) internal successors, (4866), 3497 states have internal predecessors, (4866), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4916 transitions. [2024-11-19 09:15:50,963 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4916 transitions. Word has length 22 [2024-11-19 09:15:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 3522 states and 4916 transitions. [2024-11-19 09:15:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-19 09:15:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4916 transitions. [2024-11-19 09:15:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:15:50,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:50,968 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] [2024-11-19 09:15:50,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-19 09:15:51,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash -316792903, now seen corresponding path program 1 times [2024-11-19 09:15:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736270794] [2024-11-19 09:15:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:51,170 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-19 09:15:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:51,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-19 09:15:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:51,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:51,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:51,421 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-19 09:15:51,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:51,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736270794] [2024-11-19 09:15:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736270794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024816506] [2024-11-19 09:15:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:51,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:51,424 INFO L87 Difference]: Start difference. First operand 3522 states and 4916 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-19 09:15:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:51,507 INFO L93 Difference]: Finished difference Result 3492 states and 4858 transitions. [2024-11-19 09:15:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-19 09:15:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:51,514 INFO L225 Difference]: With dead ends: 3492 [2024-11-19 09:15:51,514 INFO L226 Difference]: Without dead ends: 3492 [2024-11-19 09:15:51,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-19 09:15:51,515 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 48 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6064 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-19 09:15:51,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6064 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-19 09:15:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3492. [2024-11-19 09:15:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 2631 states have (on average 1.8274420372481945) internal successors, (4808), 3467 states have internal predecessors, (4808), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 4858 transitions. [2024-11-19 09:15:51,581 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 4858 transitions. Word has length 22 [2024-11-19 09:15:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:51,583 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 4858 transitions. [2024-11-19 09:15:51,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-19 09:15:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 4858 transitions. [2024-11-19 09:15:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:15:51,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:51,585 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] [2024-11-19 09:15:51,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-19 09:15:51,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash -544433649, now seen corresponding path program 1 times [2024-11-19 09:15:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431701365] [2024-11-19 09:15:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:51,790 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-19 09:15:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:51,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-19 09:15:51,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:51,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:51,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:51,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:52,063 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-19 09:15:52,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:52,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431701365] [2024-11-19 09:15:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431701365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:52,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435934597] [2024-11-19 09:15:52,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:52,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:52,065 INFO L87 Difference]: Start difference. First operand 3492 states and 4858 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 09:15:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:55,111 INFO L93 Difference]: Finished difference Result 3939 states and 5212 transitions. [2024-11-19 09:15:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-19 09:15:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:55,118 INFO L225 Difference]: With dead ends: 3939 [2024-11-19 09:15:55,118 INFO L226 Difference]: Without dead ends: 3939 [2024-11-19 09:15:55,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 09:15:55,119 INFO L432 NwaCegarLoop]: 1250 mSDtfsCounter, 1835 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:55,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1845 Valid, 2810 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 09:15:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2024-11-19 09:15:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3488. [2024-11-19 09:15:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2631 states have (on average 1.8244013683010263) internal successors, (4800), 3463 states have internal predecessors, (4800), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4850 transitions. [2024-11-19 09:15:55,168 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4850 transitions. Word has length 27 [2024-11-19 09:15:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:55,168 INFO L471 AbstractCegarLoop]: Abstraction has 3488 states and 4850 transitions. [2024-11-19 09:15:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 09:15:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4850 transitions. [2024-11-19 09:15:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:15:55,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:55,170 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] [2024-11-19 09:15:55,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:15:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-19 09:15:55,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:15:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -544433648, now seen corresponding path program 1 times [2024-11-19 09:15:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338037249] [2024-11-19 09:15:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:55,373 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-19 09:15:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:55,377 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-19 09:15:55,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:15:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:55,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:15:55,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:55,568 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-19 09:15:55,718 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-19 09:15:55,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:55,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:55,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338037249] [2024-11-19 09:15:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338037249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:55,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:55,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:55,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182063325] [2024-11-19 09:15:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:55,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:55,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:55,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:55,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:55,720 INFO L87 Difference]: Start difference. First operand 3488 states and 4850 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 09:15:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:59,798 INFO L93 Difference]: Finished difference Result 4222 states and 5656 transitions. [2024-11-19 09:15:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:59,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-19 09:15:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:59,805 INFO L225 Difference]: With dead ends: 4222 [2024-11-19 09:15:59,805 INFO L226 Difference]: Without dead ends: 4222 [2024-11-19 09:15:59,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 09:15:59,806 INFO L432 NwaCegarLoop]: 1741 mSDtfsCounter, 806 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:59,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 3923 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-19 09:15:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2024-11-19 09:15:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3524. [2024-11-19 09:15:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 2667 states have (on average 1.8151481064866892) internal successors, (4841), 3499 states have internal predecessors, (4841), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:15:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4891 transitions. [2024-11-19 09:15:59,847 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4891 transitions. Word has length 27 [2024-11-19 09:15:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 3524 states and 4891 transitions. [2024-11-19 09:15:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 09:15:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4891 transitions. [2024-11-19 09:15:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:15:59,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:59,849 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] [2024-11-19 09:15:59,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:00,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-19 09:16:00,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826599, now seen corresponding path program 1 times [2024-11-19 09:16:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509820767] [2024-11-19 09:16:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:00,052 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-19 09:16:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:00,056 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-19 09:16:00,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:00,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:00,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:00,297 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-19 09:16:00,355 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-19 09:16:00,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:00,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509820767] [2024-11-19 09:16:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509820767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448663623] [2024-11-19 09:16:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:00,357 INFO L87 Difference]: Start difference. First operand 3524 states and 4891 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:03,587 INFO L93 Difference]: Finished difference Result 4240 states and 5655 transitions. [2024-11-19 09:16:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-19 09:16:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:03,593 INFO L225 Difference]: With dead ends: 4240 [2024-11-19 09:16:03,593 INFO L226 Difference]: Without dead ends: 4240 [2024-11-19 09:16:03,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-19 09:16:03,594 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 1691 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:03,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4201 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 09:16:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2024-11-19 09:16:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 3520. [2024-11-19 09:16:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2667 states have (on average 1.8061492313460816) internal successors, (4817), 3495 states have internal predecessors, (4817), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4867 transitions. [2024-11-19 09:16:03,638 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4867 transitions. Word has length 36 [2024-11-19 09:16:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:03,639 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4867 transitions. [2024-11-19 09:16:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4867 transitions. [2024-11-19 09:16:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:16:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:03,640 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] [2024-11-19 09:16:03,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-19 09:16:03,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826600, now seen corresponding path program 1 times [2024-11-19 09:16:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882137936] [2024-11-19 09:16:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:03,843 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-19 09:16:03,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:03,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-19 09:16:03,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:04,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:16:04,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:04,073 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-19 09:16:04,236 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-19 09:16:04,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:04,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:04,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882137936] [2024-11-19 09:16:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882137936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:04,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:04,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449852023] [2024-11-19 09:16:04,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:04,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:04,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:04,239 INFO L87 Difference]: Start difference. First operand 3520 states and 4867 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:08,756 INFO L93 Difference]: Finished difference Result 4849 states and 6535 transitions. [2024-11-19 09:16:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:08,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-19 09:16:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:08,764 INFO L225 Difference]: With dead ends: 4849 [2024-11-19 09:16:08,764 INFO L226 Difference]: Without dead ends: 4849 [2024-11-19 09:16:08,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-19 09:16:08,765 INFO L432 NwaCegarLoop]: 2369 mSDtfsCounter, 1190 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:08,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 4978 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 09:16:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4849 states. [2024-11-19 09:16:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4849 to 3520. [2024-11-19 09:16:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2667 states have (on average 1.8031496062992125) internal successors, (4809), 3495 states have internal predecessors, (4809), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4859 transitions. [2024-11-19 09:16:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4859 transitions. Word has length 36 [2024-11-19 09:16:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:08,812 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4859 transitions. [2024-11-19 09:16:08,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4859 transitions. [2024-11-19 09:16:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:16:08,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:08,813 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] [2024-11-19 09:16:08,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:16:09,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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-19 09:16:09,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:09,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988007, now seen corresponding path program 1 times [2024-11-19 09:16:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416769988] [2024-11-19 09:16:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:09,015 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-19 09:16:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:09,016 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/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-19 09:16:09,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:09,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:09,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:09,224 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-19 09:16:09,295 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-19 09:16:09,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:09,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416769988] [2024-11-19 09:16:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416769988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:09,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154171011] [2024-11-19 09:16:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:09,297 INFO L87 Difference]: Start difference. First operand 3520 states and 4859 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:12,667 INFO L93 Difference]: Finished difference Result 4220 states and 5623 transitions. [2024-11-19 09:16:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-19 09:16:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:12,671 INFO L225 Difference]: With dead ends: 4220 [2024-11-19 09:16:12,671 INFO L226 Difference]: Without dead ends: 4220 [2024-11-19 09:16:12,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-19 09:16:12,671 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 1687 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:12,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 4201 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 09:16:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2024-11-19 09:16:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3516. [2024-11-19 09:16:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2667 states have (on average 1.8001499812523434) internal successors, (4801), 3491 states have internal predecessors, (4801), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4851 transitions. [2024-11-19 09:16:12,713 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4851 transitions. Word has length 36 [2024-11-19 09:16:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:12,714 INFO L471 AbstractCegarLoop]: Abstraction has 3516 states and 4851 transitions. [2024-11-19 09:16:12,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4851 transitions. [2024-11-19 09:16:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:16:12,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:12,715 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] [2024-11-19 09:16:12,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-19 09:16:12,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/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-19 09:16:12,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:12,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988008, now seen corresponding path program 1 times [2024-11-19 09:16:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225661936] [2024-11-19 09:16:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:12,916 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-19 09:16:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:12,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/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-19 09:16:12,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:13,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:16:13,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:13,134 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-19 09:16:13,291 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-19 09:16:13,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:13,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225661936] [2024-11-19 09:16:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225661936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957808256] [2024-11-19 09:16:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:13,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:13,293 INFO L87 Difference]: Start difference. First operand 3516 states and 4851 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:18,016 INFO L93 Difference]: Finished difference Result 4841 states and 6519 transitions. [2024-11-19 09:16:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-19 09:16:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:18,020 INFO L225 Difference]: With dead ends: 4841 [2024-11-19 09:16:18,020 INFO L226 Difference]: Without dead ends: 4841 [2024-11-19 09:16:18,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-19 09:16:18,021 INFO L432 NwaCegarLoop]: 2365 mSDtfsCounter, 1182 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 4940 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:18,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 4940 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-19 09:16:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2024-11-19 09:16:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3512. [2024-11-19 09:16:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2667 states have (on average 1.7971503562054743) internal successors, (4793), 3487 states have internal predecessors, (4793), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 4843 transitions. [2024-11-19 09:16:18,064 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 4843 transitions. Word has length 36 [2024-11-19 09:16:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 4843 transitions. [2024-11-19 09:16:18,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-19 09:16:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4843 transitions. [2024-11-19 09:16:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 09:16:18,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:18,066 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] [2024-11-19 09:16:18,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/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-19 09:16:18,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 841114057, now seen corresponding path program 1 times [2024-11-19 09:16:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987729251] [2024-11-19 09:16:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:18,269 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-19 09:16:18,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:18,272 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/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-19 09:16:18,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:18,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:18,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:18,518 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-19 09:16:18,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:18,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987729251] [2024-11-19 09:16:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987729251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:18,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552387896] [2024-11-19 09:16:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:18,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:18,520 INFO L87 Difference]: Start difference. First operand 3512 states and 4843 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-19 09:16:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:18,587 INFO L93 Difference]: Finished difference Result 3500 states and 4819 transitions. [2024-11-19 09:16:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-19 09:16:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:18,591 INFO L225 Difference]: With dead ends: 3500 [2024-11-19 09:16:18,592 INFO L226 Difference]: Without dead ends: 3500 [2024-11-19 09:16:18,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-19 09:16:18,592 INFO L432 NwaCegarLoop]: 2016 mSDtfsCounter, 27 mSDsluCounter, 3995 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6011 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-19 09:16:18,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6011 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2024-11-19 09:16:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3500. [2024-11-19 09:16:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2655 states have (on average 1.7962335216572505) internal successors, (4769), 3475 states have internal predecessors, (4769), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4819 transitions. [2024-11-19 09:16:18,630 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4819 transitions. Word has length 41 [2024-11-19 09:16:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:18,630 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 4819 transitions. [2024-11-19 09:16:18,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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-19 09:16:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4819 transitions. [2024-11-19 09:16:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 09:16:18,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:18,632 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] [2024-11-19 09:16:18,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:18,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/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-19 09:16:18,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:18,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 385316629, now seen corresponding path program 1 times [2024-11-19 09:16:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064267983] [2024-11-19 09:16:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:18,834 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-19 09:16:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:18,837 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/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-19 09:16:18,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:19,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:19,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:19,268 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-19 09:16:19,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:19,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064267983] [2024-11-19 09:16:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064267983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:19,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:19,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:19,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867274823] [2024-11-19 09:16:19,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:19,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:19,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:19,270 INFO L87 Difference]: Start difference. First operand 3500 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-19 09:16:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:19,466 INFO L93 Difference]: Finished difference Result 5151 states and 6877 transitions. [2024-11-19 09:16:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-19 09:16:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:19,472 INFO L225 Difference]: With dead ends: 5151 [2024-11-19 09:16:19,472 INFO L226 Difference]: Without dead ends: 5151 [2024-11-19 09:16:19,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-19 09:16:19,472 INFO L432 NwaCegarLoop]: 2101 mSDtfsCounter, 1299 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:19,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 4032 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:16:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2024-11-19 09:16:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4554. [2024-11-19 09:16:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3702 states have (on average 1.7847109670448407) internal successors, (6607), 4519 states have internal predecessors, (6607), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:16:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6677 transitions. [2024-11-19 09:16:19,530 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 6677 transitions. Word has length 49 [2024-11-19 09:16:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:19,531 INFO L471 AbstractCegarLoop]: Abstraction has 4554 states and 6677 transitions. [2024-11-19 09:16:19,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-19 09:16:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6677 transitions. [2024-11-19 09:16:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 09:16:19,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:19,532 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] [2024-11-19 09:16:19,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:19,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/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-19 09:16:19,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:19,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666657, now seen corresponding path program 1 times [2024-11-19 09:16:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:19,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853689624] [2024-11-19 09:16:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:19,734 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-19 09:16:19,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:19,737 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/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-19 09:16:19,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:20,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:20,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:20,076 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-19 09:16:20,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:20,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853689624] [2024-11-19 09:16:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853689624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:20,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:20,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031239898] [2024-11-19 09:16:20,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:20,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:20,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:20,078 INFO L87 Difference]: Start difference. First operand 4554 states and 6677 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-19 09:16:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:20,147 INFO L93 Difference]: Finished difference Result 4512 states and 6607 transitions. [2024-11-19 09:16:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-19 09:16:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:20,170 INFO L225 Difference]: With dead ends: 4512 [2024-11-19 09:16:20,171 INFO L226 Difference]: Without dead ends: 4512 [2024-11-19 09:16:20,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-19 09:16:20,171 INFO L432 NwaCegarLoop]: 2012 mSDtfsCounter, 27 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5999 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-19 09:16:20,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5999 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2024-11-19 09:16:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4512. [2024-11-19 09:16:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3660 states have (on average 1.7860655737704918) internal successors, (6537), 4477 states have internal predecessors, (6537), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:16:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6607 transitions. [2024-11-19 09:16:20,205 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6607 transitions. Word has length 52 [2024-11-19 09:16:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:20,206 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 6607 transitions. [2024-11-19 09:16:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-19 09:16:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6607 transitions. [2024-11-19 09:16:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 09:16:20,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:20,206 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] [2024-11-19 09:16:20,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/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-19 09:16:20,407 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:20,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 705263610, now seen corresponding path program 1 times [2024-11-19 09:16:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967468127] [2024-11-19 09:16:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:20,408 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-19 09:16:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:20,409 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/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-19 09:16:20,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:20,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:20,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:20,701 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-19 09:16:20,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:20,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:20,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967468127] [2024-11-19 09:16:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967468127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303670440] [2024-11-19 09:16:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:20,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:20,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:20,703 INFO L87 Difference]: Start difference. First operand 4512 states and 6607 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-19 09:16:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:20,781 INFO L93 Difference]: Finished difference Result 4494 states and 6577 transitions. [2024-11-19 09:16:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-19 09:16:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:20,788 INFO L225 Difference]: With dead ends: 4494 [2024-11-19 09:16:20,788 INFO L226 Difference]: Without dead ends: 4494 [2024-11-19 09:16:20,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-19 09:16:20,789 INFO L432 NwaCegarLoop]: 2008 mSDtfsCounter, 21 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5993 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-19 09:16:20,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5993 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-11-19 09:16:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4494. [2024-11-19 09:16:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4494 states, 3642 states have (on average 1.78665568369028) internal successors, (6507), 4459 states have internal predecessors, (6507), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:16:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 6577 transitions. [2024-11-19 09:16:20,840 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 6577 transitions. Word has length 55 [2024-11-19 09:16:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 4494 states and 6577 transitions. [2024-11-19 09:16:20,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-19 09:16:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 6577 transitions. [2024-11-19 09:16:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 09:16:20,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:20,842 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] [2024-11-19 09:16:20,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/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-19 09:16:21,043 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:21,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1394668725, now seen corresponding path program 1 times [2024-11-19 09:16:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822710035] [2024-11-19 09:16:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:21,044 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-19 09:16:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:21,047 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/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-19 09:16:21,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-19 09:16:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:21,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:21,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:21,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:21,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:21,358 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-19 09:16:21,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:16:21,392 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-19 09:16:21,432 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-19 09:16:21,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:21,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822710035] [2024-11-19 09:16:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822710035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:21,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384511913] [2024-11-19 09:16:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:21,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:21,435 INFO L87 Difference]: Start difference. First operand 4494 states and 6577 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:22,302 INFO L93 Difference]: Finished difference Result 5952 states and 8592 transitions. [2024-11-19 09:16:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-19 09:16:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:22,312 INFO L225 Difference]: With dead ends: 5952 [2024-11-19 09:16:22,313 INFO L226 Difference]: Without dead ends: 5952 [2024-11-19 09:16:22,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-19 09:16:22,313 INFO L432 NwaCegarLoop]: 2130 mSDtfsCounter, 1694 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:22,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 5455 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 09:16:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-19 09:16:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4460. [2024-11-19 09:16:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 3608 states have (on average 1.793791574279379) internal successors, (6472), 4425 states have internal predecessors, (6472), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:16:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 6542 transitions. [2024-11-19 09:16:22,371 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 6542 transitions. Word has length 60 [2024-11-19 09:16:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:22,371 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 6542 transitions. [2024-11-19 09:16:22,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 6542 transitions. [2024-11-19 09:16:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 09:16:22,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:22,372 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] [2024-11-19 09:16:22,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-19 09:16:22,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/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-19 09:16:22,573 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1034209811, now seen corresponding path program 1 times [2024-11-19 09:16:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888269402] [2024-11-19 09:16:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:22,574 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-19 09:16:22,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:22,577 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/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-19 09:16:22,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:16:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:22,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:22,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:23,120 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-19 09:16:23,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:23,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888269402] [2024-11-19 09:16:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888269402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096731825] [2024-11-19 09:16:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:23,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:23,123 INFO L87 Difference]: Start difference. First operand 4460 states and 6542 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-19 09:16:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:23,257 INFO L93 Difference]: Finished difference Result 6108 states and 8657 transitions. [2024-11-19 09:16:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:23,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-19 09:16:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:23,265 INFO L225 Difference]: With dead ends: 6108 [2024-11-19 09:16:23,265 INFO L226 Difference]: Without dead ends: 6108 [2024-11-19 09:16:23,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-19 09:16:23,266 INFO L432 NwaCegarLoop]: 2027 mSDtfsCounter, 1009 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:23,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3988 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:16:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6108 states. [2024-11-19 09:16:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6108 to 5560. [2024-11-19 09:16:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4700 states have (on average 1.7717021276595746) internal successors, (8327), 5514 states have internal predecessors, (8327), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 09:16:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 8419 transitions. [2024-11-19 09:16:23,323 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 8419 transitions. Word has length 60 [2024-11-19 09:16:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 5560 states and 8419 transitions. [2024-11-19 09:16:23,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-19 09:16:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 8419 transitions. [2024-11-19 09:16:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:16:23,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:23,324 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] [2024-11-19 09:16:23,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-19 09:16:23,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/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-19 09:16:23,528 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:23,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1844344716, now seen corresponding path program 1 times [2024-11-19 09:16:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941045532] [2024-11-19 09:16:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:23,530 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-19 09:16:23,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:23,533 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/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-19 09:16:23,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 09:16:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:23,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:16:23,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:23,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:23,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:23,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:23,933 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 30 treesize of output 39 [2024-11-19 09:16:24,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:16:24,130 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 70 treesize of output 26 [2024-11-19 09:16:24,146 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-19 09:16:24,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:24,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:24,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941045532] [2024-11-19 09:16:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941045532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704993922] [2024-11-19 09:16:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:24,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:24,151 INFO L87 Difference]: Start difference. First operand 5560 states and 8419 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-19 09:16:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:24,756 INFO L93 Difference]: Finished difference Result 5884 states and 8505 transitions. [2024-11-19 09:16:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-19 09:16:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:24,765 INFO L225 Difference]: With dead ends: 5884 [2024-11-19 09:16:24,766 INFO L226 Difference]: Without dead ends: 5884 [2024-11-19 09:16:24,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-19 09:16:24,767 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 857 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 6353 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:24,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 6353 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:16:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2024-11-19 09:16:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 5119. [2024-11-19 09:16:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5119 states, 4259 states have (on average 1.7912655552946701) internal successors, (7629), 5076 states have internal predecessors, (7629), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 09:16:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 7715 transitions. [2024-11-19 09:16:24,831 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 7715 transitions. Word has length 63 [2024-11-19 09:16:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:24,831 INFO L471 AbstractCegarLoop]: Abstraction has 5119 states and 7715 transitions. [2024-11-19 09:16:24,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-19 09:16:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 7715 transitions. [2024-11-19 09:16:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:16:24,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:24,832 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] [2024-11-19 09:16:24,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-19 09:16:25,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/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-19 09:16:25,033 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-19 09:16:25,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1265725906, now seen corresponding path program 1 times [2024-11-19 09:16:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:25,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155381112] [2024-11-19 09:16:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:25,034 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-19 09:16:25,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:25,037 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/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-19 09:16:25,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-19 09:16:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:25,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:16:25,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:25,416 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-19 09:16:25,422 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