./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:04:02,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:04:03,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:04:03,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:04:03,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:04:03,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:04:03,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:04:03,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:04:03,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:04:03,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:04:03,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:04:03,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:04:03,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:04:03,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:04:03,097 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:04:03,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:04:03,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:04:03,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:04:03,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:04:03,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:04:03,098 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:04:03,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:04:03,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:04:03,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:04:03,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:04:03,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:04:03,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:04:03,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:04:03,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:04:03,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:04:03,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:04:03,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:04:03,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:04:03,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:04:03,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:04:03,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:04:03,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:04:03,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:04:03,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:04:03,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:04:03,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:04:03,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:04:03,111 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 -> 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 [2024-10-13 12:04:03,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:04:03,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:04:03,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:04:03,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:04:03,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:04:03,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2024-10-13 12:04:05,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:04:05,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:04:05,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2024-10-13 12:04:05,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7ede518/d9d184de9a094b6d86a93cfb4e8f1fa0/FLAGe29409361 [2024-10-13 12:04:05,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7ede518/d9d184de9a094b6d86a93cfb4e8f1fa0 [2024-10-13 12:04:05,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:04:05,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:04:05,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:04:05,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:04:05,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:04:05,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:04:05" (1/1) ... [2024-10-13 12:04:05,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2d85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:05, skipping insertion in model container [2024-10-13 12:04:05,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:04:05" (1/1) ... [2024-10-13 12:04:05,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:04:06,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:04:06,073 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-10-13 12:04:06,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@20fd4d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:06, skipping insertion in model container [2024-10-13 12:04:06,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:04:06,075 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:04:06,077 INFO L158 Benchmark]: Toolchain (without parser) took 730.93ms. Allocated memory is still 153.1MB. Free memory was 90.1MB in the beginning and 108.1MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:04:06,078 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:04:06,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.44ms. Allocated memory is still 153.1MB. Free memory was 89.7MB in the beginning and 108.1MB in the end (delta: -18.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:04:06,080 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.23ms. Allocated memory is still 96.5MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.44ms. Allocated memory is still 153.1MB. Free memory was 89.7MB in the beginning and 108.1MB in the end (delta: -18.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:04:08,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:04:08,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:04:08,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:04:08,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:04:08,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:04:08,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:04:08,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:04:08,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:04:08,299 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:04:08,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:04:08,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:04:08,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:04:08,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:04:08,301 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:04:08,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:04:08,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:04:08,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:04:08,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:04:08,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:04:08,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:04:08,304 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:04:08,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:04:08,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:04:08,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:04:08,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:04:08,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:04:08,306 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:04:08,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:04:08,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:04:08,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:04:08,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:04:08,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:04:08,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:04:08,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:04:08,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:04:08,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:04:08,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:04:08,309 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:04:08,310 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:04:08,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:04:08,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:04:08,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:04:08,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:04:08,312 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:04:08,313 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 -> 64683904124af3c899dbc8dc5465d8741c0ff10567af23b7315c834db1157458 [2024-10-13 12:04:08,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:04:08,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:04:08,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:04:08,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:04:08,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:04:08,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2024-10-13 12:04:10,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:04:10,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:04:10,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-2.i [2024-10-13 12:04:10,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fe8e9be/2e431df2381a4d91abb00dfdb128b4be/FLAG7bc651ce4 [2024-10-13 12:04:10,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fe8e9be/2e431df2381a4d91abb00dfdb128b4be [2024-10-13 12:04:10,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:04:10,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:04:10,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:04:10,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:04:10,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:04:10,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:04:10" (1/1) ... [2024-10-13 12:04:10,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191134e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:10, skipping insertion in model container [2024-10-13 12:04:10,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:04:10" (1/1) ... [2024-10-13 12:04:10,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:04:11,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:04:11,616 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:04:11,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:04:11,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:04:11,785 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:04:11,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:04:11,945 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:04:11,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11 WrapperNode [2024-10-13 12:04:11,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:04:11,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:04:11,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:04:11,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:04:11,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,110 INFO L138 Inliner]: procedures = 179, calls = 387, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1351 [2024-10-13 12:04:12,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:04:12,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:04:12,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:04:12,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:04:12,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,261 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-10-13 12:04:12,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:04:12,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:04:12,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:04:12,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:04:12,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (1/1) ... [2024-10-13 12:04:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:04:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:04:12,425 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-10-13 12:04:12,431 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-10-13 12:04:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 12:04:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 12:04:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:04:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:04:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:04:12,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:04:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 12:04:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 12:04:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 12:04:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 12:04:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:04:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:04:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:04:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:04:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:04:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:04:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:04:12,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:04:12,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:04:12,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:04:12,734 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:04:12,794 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:04:18,078 INFO L? ?]: Removed 1547 outVars from TransFormulas that were not future-live. [2024-10-13 12:04:18,078 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:04:18,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:04:18,328 INFO L314 CfgBuilder]: Removed 69 assume(true) statements. [2024-10-13 12:04:18,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:04:18 BoogieIcfgContainer [2024-10-13 12:04:18,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:04:18,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:04:18,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:04:18,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:04:18,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:04:10" (1/3) ... [2024-10-13 12:04:18,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f168d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:04:18, skipping insertion in model container [2024-10-13 12:04:18,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:04:11" (2/3) ... [2024-10-13 12:04:18,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f168d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:04:18, skipping insertion in model container [2024-10-13 12:04:18,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:04:18" (3/3) ... [2024-10-13 12:04:18,338 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-2.i [2024-10-13 12:04:18,358 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:04:18,359 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-10-13 12:04:18,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:04:18,458 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;@36f2783e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:04:18,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-10-13 12:04:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 1312 states, 566 states have (on average 2.545936395759717) internal successors, (1441), 1303 states have internal predecessors, (1441), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 12:04:18,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:18,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 12:04:18,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 69709116, now seen corresponding path program 1 times [2024-10-13 12:04:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731682578] [2024-10-13 12:04:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:18,497 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-10-13 12:04:18,500 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-10-13 12:04:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:18,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:18,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:18,742 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-10-13 12:04:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:18,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:18,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:18,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731682578] [2024-10-13 12:04:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731682578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034013718] [2024-10-13 12:04:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:18,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:18,846 INFO L87 Difference]: Start difference. First operand has 1312 states, 566 states have (on average 2.545936395759717) internal successors, (1441), 1303 states have internal predecessors, (1441), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:04:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:21,047 INFO L93 Difference]: Finished difference Result 1201 states and 1285 transitions. [2024-10-13 12:04:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:21,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-13 12:04:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:21,078 INFO L225 Difference]: With dead ends: 1201 [2024-10-13 12:04:21,079 INFO L226 Difference]: Without dead ends: 1200 [2024-10-13 12:04:21,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-13 12:04:21,084 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 926 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:21,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 747 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 12:04:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-13 12:04:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1198. [2024-10-13 12:04:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 557 states have (on average 2.2423698384201076) internal successors, (1249), 1189 states have internal predecessors, (1249), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1281 transitions. [2024-10-13 12:04:21,180 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1281 transitions. Word has length 4 [2024-10-13 12:04:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:21,181 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1281 transitions. [2024-10-13 12:04:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:04:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1281 transitions. [2024-10-13 12:04:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 12:04:21,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:21,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 12:04:21,187 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:04:21,384 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-10-13 12:04:21,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:21,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 69709117, now seen corresponding path program 1 times [2024-10-13 12:04:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:21,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796560167] [2024-10-13 12:04:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:21,387 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-10-13 12:04:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:21,390 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-10-13 12:04:21,393 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-10-13 12:04:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:21,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:04:21,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:21,528 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-10-13 12:04:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:21,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:21,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796560167] [2024-10-13 12:04:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796560167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236238902] [2024-10-13 12:04:21,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:21,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:21,555 INFO L87 Difference]: Start difference. First operand 1198 states and 1281 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:04:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:24,581 INFO L93 Difference]: Finished difference Result 1478 states and 1581 transitions. [2024-10-13 12:04:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-13 12:04:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:24,589 INFO L225 Difference]: With dead ends: 1478 [2024-10-13 12:04:24,590 INFO L226 Difference]: Without dead ends: 1478 [2024-10-13 12:04:24,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-13 12:04:24,592 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 464 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:24,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1429 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 12:04:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-10-13 12:04:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1327. [2024-10-13 12:04:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 696 states have (on average 2.199712643678161) internal successors, (1531), 1318 states have internal predecessors, (1531), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1563 transitions. [2024-10-13 12:04:24,646 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1563 transitions. Word has length 4 [2024-10-13 12:04:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:24,647 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1563 transitions. [2024-10-13 12:04:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-13 12:04:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1563 transitions. [2024-10-13 12:04:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 12:04:24,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:24,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:04:24,654 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-10-13 12:04:24,852 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-10-13 12:04:24,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2132325201, now seen corresponding path program 1 times [2024-10-13 12:04:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050449583] [2024-10-13 12:04:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:24,854 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-10-13 12:04:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:24,858 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-10-13 12:04:24,859 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-10-13 12:04:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:25,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:04:25,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:25,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:25,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050449583] [2024-10-13 12:04:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050449583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:25,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:25,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689102537] [2024-10-13 12:04:25,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:25,024 INFO L87 Difference]: Start difference. First operand 1327 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-13 12:04:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:26,319 INFO L93 Difference]: Finished difference Result 2427 states and 2868 transitions. [2024-10-13 12:04:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-10-13 12:04:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:26,331 INFO L225 Difference]: With dead ends: 2427 [2024-10-13 12:04:26,332 INFO L226 Difference]: Without dead ends: 2427 [2024-10-13 12:04:26,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 12:04:26,334 INFO L432 NwaCegarLoop]: 1308 mSDtfsCounter, 1000 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:26,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2436 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 12:04:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2024-10-13 12:04:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1328. [2024-10-13 12:04:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 697 states have (on average 2.1979913916786225) internal successors, (1532), 1319 states have internal predecessors, (1532), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1564 transitions. [2024-10-13 12:04:26,383 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1564 transitions. Word has length 5 [2024-10-13 12:04:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:26,384 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1564 transitions. [2024-10-13 12:04:26,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-13 12:04:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1564 transitions. [2024-10-13 12:04:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:04:26,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:26,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:26,389 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-10-13 12:04:26,585 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-10-13 12:04:26,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:26,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 358375302, now seen corresponding path program 1 times [2024-10-13 12:04:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:26,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687218415] [2024-10-13 12:04:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:26,594 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-10-13 12:04:26,599 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-10-13 12:04:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:26,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:04:26,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:26,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:26,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687218415] [2024-10-13 12:04:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687218415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:26,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:26,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121004895] [2024-10-13 12:04:26,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:26,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:26,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:26,769 INFO L87 Difference]: Start difference. First operand 1328 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-13 12:04:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:27,640 INFO L93 Difference]: Finished difference Result 1289 states and 1524 transitions. [2024-10-13 12:04:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-10-13 12:04:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:27,647 INFO L225 Difference]: With dead ends: 1289 [2024-10-13 12:04:27,648 INFO L226 Difference]: Without dead ends: 1289 [2024-10-13 12:04:27,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-13 12:04:27,649 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 61 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:27,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2126 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 12:04:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-13 12:04:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2024-10-13 12:04:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 682 states have (on average 2.187683284457478) internal successors, (1492), 1280 states have internal predecessors, (1492), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1524 transitions. [2024-10-13 12:04:27,679 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1524 transitions. Word has length 10 [2024-10-13 12:04:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1524 transitions. [2024-10-13 12:04:27,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-13 12:04:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1524 transitions. [2024-10-13 12:04:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:04:27,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:27,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:27,687 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-10-13 12:04:27,884 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-10-13 12:04:27,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:27,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 801277664, now seen corresponding path program 1 times [2024-10-13 12:04:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821264472] [2024-10-13 12:04:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:27,889 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-10-13 12:04:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:27,893 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-10-13 12:04:27,895 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-10-13 12:04:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:28,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:28,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:28,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:28,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821264472] [2024-10-13 12:04:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821264472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769897256] [2024-10-13 12:04:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:28,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:28,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:28,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:28,096 INFO L87 Difference]: Start difference. First operand 1289 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:04:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:29,266 INFO L93 Difference]: Finished difference Result 1274 states and 1502 transitions. [2024-10-13 12:04:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:04:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-13 12:04:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:29,272 INFO L225 Difference]: With dead ends: 1274 [2024-10-13 12:04:29,272 INFO L226 Difference]: Without dead ends: 1274 [2024-10-13 12:04:29,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10-13 12:04:29,273 INFO L432 NwaCegarLoop]: 1053 mSDtfsCounter, 45 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:29,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3141 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:04:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-13 12:04:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2024-10-13 12:04:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 681 states have (on average 2.158590308370044) internal successors, (1470), 1265 states have internal predecessors, (1470), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1502 transitions. [2024-10-13 12:04:29,296 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1502 transitions. Word has length 12 [2024-10-13 12:04:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1502 transitions. [2024-10-13 12:04:29,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:04:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1502 transitions. [2024-10-13 12:04:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:04:29,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:29,298 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] [2024-10-13 12:04:29,303 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-10-13 12:04:29,498 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-10-13 12:04:29,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:29,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1911588786, now seen corresponding path program 1 times [2024-10-13 12:04:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747670565] [2024-10-13 12:04:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:29,500 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-10-13 12:04:29,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:29,501 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-10-13 12:04:29,502 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-10-13 12:04:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:29,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:04:29,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:29,670 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-10-13 12:04:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:29,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:29,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747670565] [2024-10-13 12:04:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747670565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228626203] [2024-10-13 12:04:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:29,754 INFO L87 Difference]: Start difference. First operand 1274 states and 1502 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 12:04:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:32,126 INFO L93 Difference]: Finished difference Result 1274 states and 1502 transitions. [2024-10-13 12:04:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-13 12:04:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:32,133 INFO L225 Difference]: With dead ends: 1274 [2024-10-13 12:04:32,134 INFO L226 Difference]: Without dead ends: 1274 [2024-10-13 12:04:32,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-13 12:04:32,135 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 870 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:32,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1174 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 12:04:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-13 12:04:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1270. [2024-10-13 12:04:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 681 states have (on average 2.1527165932452275) internal successors, (1466), 1261 states have internal predecessors, (1466), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1498 transitions. [2024-10-13 12:04:32,162 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1498 transitions. Word has length 26 [2024-10-13 12:04:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:32,162 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1498 transitions. [2024-10-13 12:04:32,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 12:04:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1498 transitions. [2024-10-13 12:04:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:04:32,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:32,164 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] [2024-10-13 12:04:32,169 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-10-13 12:04:32,368 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-10-13 12:04:32,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1911588785, now seen corresponding path program 1 times [2024-10-13 12:04:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706833245] [2024-10-13 12:04:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:32,371 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-10-13 12:04:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:32,376 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-10-13 12:04:32,377 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-10-13 12:04:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:32,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:04:32,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:32,544 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-10-13 12:04:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:32,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:32,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706833245] [2024-10-13 12:04:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706833245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:32,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622115434] [2024-10-13 12:04:32,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:32,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:32,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:32,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:32,767 INFO L87 Difference]: Start difference. First operand 1270 states and 1498 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 12:04:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:35,955 INFO L93 Difference]: Finished difference Result 1421 states and 1516 transitions. [2024-10-13 12:04:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:35,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-10-13 12:04:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:35,961 INFO L225 Difference]: With dead ends: 1421 [2024-10-13 12:04:35,961 INFO L226 Difference]: Without dead ends: 1421 [2024-10-13 12:04:35,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-13 12:04:35,962 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 404 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:35,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1901 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 12:04:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-10-13 12:04:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1266. [2024-10-13 12:04:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 681 states have (on average 2.146842878120411) internal successors, (1462), 1257 states have internal predecessors, (1462), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1494 transitions. [2024-10-13 12:04:35,989 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1494 transitions. Word has length 26 [2024-10-13 12:04:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1494 transitions. [2024-10-13 12:04:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-10-13 12:04:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1494 transitions. [2024-10-13 12:04:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 12:04:35,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:35,992 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] [2024-10-13 12:04:35,999 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 (8)] Ended with exit code 0 [2024-10-13 12:04:36,193 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-10-13 12:04:36,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 470489544, now seen corresponding path program 1 times [2024-10-13 12:04:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414943355] [2024-10-13 12:04:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:36,196 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-10-13 12:04:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:36,199 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-10-13 12:04:36,200 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-10-13 12:04:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:36,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:36,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:36,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:36,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414943355] [2024-10-13 12:04:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414943355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:36,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704425694] [2024-10-13 12:04:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:36,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:36,527 INFO L87 Difference]: Start difference. First operand 1266 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-13 12:04:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:37,403 INFO L93 Difference]: Finished difference Result 1260 states and 1484 transitions. [2024-10-13 12:04:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:04:37,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-10-13 12:04:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:37,411 INFO L225 Difference]: With dead ends: 1260 [2024-10-13 12:04:37,411 INFO L226 Difference]: Without dead ends: 1260 [2024-10-13 12:04:37,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-10-13 12:04:37,412 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 15 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:37,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3124 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 12:04:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-13 12:04:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1260. [2024-10-13 12:04:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 675 states have (on average 2.151111111111111) internal successors, (1452), 1251 states have internal predecessors, (1452), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1484 transitions. [2024-10-13 12:04:37,436 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1484 transitions. Word has length 42 [2024-10-13 12:04:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:37,437 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1484 transitions. [2024-10-13 12:04:37,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-13 12:04:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1484 transitions. [2024-10-13 12:04:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 12:04:37,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:37,438 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] [2024-10-13 12:04:37,447 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-10-13 12:04:37,639 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-10-13 12:04:37,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:37,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1674619112, now seen corresponding path program 1 times [2024-10-13 12:04:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667529490] [2024-10-13 12:04:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:37,642 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-10-13 12:04:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:37,646 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-10-13 12:04:37,648 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-10-13 12:04:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:37,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:37,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:38,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:38,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667529490] [2024-10-13 12:04:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667529490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278682160] [2024-10-13 12:04:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:38,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:38,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:38,088 INFO L87 Difference]: Start difference. First operand 1260 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-10-13 12:04:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:38,996 INFO L93 Difference]: Finished difference Result 1457 states and 1710 transitions. [2024-10-13 12:04:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-10-13 12:04:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:39,002 INFO L225 Difference]: With dead ends: 1457 [2024-10-13 12:04:39,002 INFO L226 Difference]: Without dead ends: 1457 [2024-10-13 12:04:39,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10-13 12:04:39,003 INFO L432 NwaCegarLoop]: 1114 mSDtfsCounter, 161 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:39,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2114 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:04:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-10-13 12:04:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1303. [2024-10-13 12:04:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 718 states have (on average 2.082172701949861) internal successors, (1495), 1294 states have internal predecessors, (1495), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1527 transitions. [2024-10-13 12:04:39,033 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1527 transitions. Word has length 46 [2024-10-13 12:04:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:39,034 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1527 transitions. [2024-10-13 12:04:39,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-10-13 12:04:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1527 transitions. [2024-10-13 12:04:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 12:04:39,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:39,036 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-10-13 12:04:39,045 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-10-13 12:04:39,236 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-10-13 12:04:39,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:39,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1869617577, now seen corresponding path program 1 times [2024-10-13 12:04:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104637949] [2024-10-13 12:04:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:39,238 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-10-13 12:04:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:39,241 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-10-13 12:04:39,243 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-10-13 12:04:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:39,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:04:39,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:39,559 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-10-13 12:04:39,565 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-10-13 12:04:40,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:04:40,011 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-10-13 12:04:40,033 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:04:40,033 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-10-13 12:04:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:40,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:40,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:40,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104637949] [2024-10-13 12:04:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104637949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:40,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542261258] [2024-10-13 12:04:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:40,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:40,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:40,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:40,058 INFO L87 Difference]: Start difference. First operand 1303 states and 1527 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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-10-13 12:04:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:42,230 INFO L93 Difference]: Finished difference Result 1219 states and 1443 transitions. [2024-10-13 12:04:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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-10-13 12:04:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:42,234 INFO L225 Difference]: With dead ends: 1219 [2024-10-13 12:04:42,234 INFO L226 Difference]: Without dead ends: 1219 [2024-10-13 12:04:42,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-10-13 12:04:42,235 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 782 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:42,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 644 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 12:04:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-13 12:04:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1080. [2024-10-13 12:04:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 579 states have (on average 1.932642487046632) internal successors, (1119), 1071 states have internal predecessors, (1119), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1151 transitions. [2024-10-13 12:04:42,253 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1151 transitions. Word has length 49 [2024-10-13 12:04:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1151 transitions. [2024-10-13 12:04:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 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-10-13 12:04:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1151 transitions. [2024-10-13 12:04:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 12:04:42,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:42,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:42,265 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-10-13 12:04:42,455 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-10-13 12:04:42,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:42,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash -804994658, now seen corresponding path program 1 times [2024-10-13 12:04:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457985631] [2024-10-13 12:04:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:42,457 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-10-13 12:04:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:42,458 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-10-13 12:04:42,459 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-10-13 12:04:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:42,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:04:42,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:42,691 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-10-13 12:04:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:04:42,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 12:04:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:42,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:42,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:42,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457985631] [2024-10-13 12:04:42,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457985631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:42,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:42,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:42,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968507351] [2024-10-13 12:04:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:04:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:42,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:04:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:42,749 INFO L87 Difference]: Start difference. First operand 1080 states and 1151 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:45,104 INFO L93 Difference]: Finished difference Result 1079 states and 1150 transitions. [2024-10-13 12:04:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:04:45,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-13 12:04:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:45,108 INFO L225 Difference]: With dead ends: 1079 [2024-10-13 12:04:45,108 INFO L226 Difference]: Without dead ends: 1079 [2024-10-13 12:04:45,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:04:45,109 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 2 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:45,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2519 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 12:04:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-10-13 12:04:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2024-10-13 12:04:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 579 states have (on average 1.930915371329879) internal successors, (1118), 1070 states have internal predecessors, (1118), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1150 transitions. [2024-10-13 12:04:45,129 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1150 transitions. Word has length 53 [2024-10-13 12:04:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:45,130 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1150 transitions. [2024-10-13 12:04:45,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1150 transitions. [2024-10-13 12:04:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 12:04:45,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:45,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:45,141 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 (12)] Ended with exit code 0 [2024-10-13 12:04:45,332 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-10-13 12:04:45,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -804994657, now seen corresponding path program 1 times [2024-10-13 12:04:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245601973] [2024-10-13 12:04:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:45,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-10-13 12:04:45,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:45,337 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-10-13 12:04:45,338 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-10-13 12:04:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:45,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:04:45,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:45,577 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-10-13 12:04:45,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 12:04:45,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:04:45,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 12:04:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:45,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:45,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245601973] [2024-10-13 12:04:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245601973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317466924] [2024-10-13 12:04:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:45,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:04:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:04:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:45,695 INFO L87 Difference]: Start difference. First operand 1079 states and 1150 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:48,526 INFO L93 Difference]: Finished difference Result 1078 states and 1149 transitions. [2024-10-13 12:04:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:04:48,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-13 12:04:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:48,530 INFO L225 Difference]: With dead ends: 1078 [2024-10-13 12:04:48,530 INFO L226 Difference]: Without dead ends: 1078 [2024-10-13 12:04:48,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:04:48,531 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:48,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2548 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 12:04:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-10-13 12:04:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-10-13 12:04:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 578 states have (on average 1.9325259515570934) internal successors, (1117), 1069 states have internal predecessors, (1117), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:04:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1149 transitions. [2024-10-13 12:04:48,549 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1149 transitions. Word has length 53 [2024-10-13 12:04:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1149 transitions. [2024-10-13 12:04:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1149 transitions. [2024-10-13 12:04:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 12:04:48,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:48,550 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] [2024-10-13 12:04:48,559 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-10-13 12:04:48,751 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-10-13 12:04:48,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:48,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -226575358, now seen corresponding path program 1 times [2024-10-13 12:04:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022303541] [2024-10-13 12:04:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:48,753 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-10-13 12:04:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:48,756 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-10-13 12:04:48,758 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-10-13 12:04:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:49,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:49,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:49,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:49,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022303541] [2024-10-13 12:04:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022303541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106046727] [2024-10-13 12:04:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:49,061 INFO L87 Difference]: Start difference. First operand 1078 states and 1149 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:04:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:49,941 INFO L93 Difference]: Finished difference Result 1080 states and 1153 transitions. [2024-10-13 12:04:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-13 12:04:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:49,945 INFO L225 Difference]: With dead ends: 1080 [2024-10-13 12:04:49,946 INFO L226 Difference]: Without dead ends: 1080 [2024-10-13 12:04:49,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:49,946 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 0 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2916 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:04:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-13 12:04:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2024-10-13 12:04:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 579 states have (on average 1.932642487046632) internal successors, (1119), 1071 states have internal predecessors, (1119), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 12:04:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1153 transitions. [2024-10-13 12:04:49,969 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1153 transitions. Word has length 59 [2024-10-13 12:04:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:49,970 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1153 transitions. [2024-10-13 12:04:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:04:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1153 transitions. [2024-10-13 12:04:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:04:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:49,971 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-10-13 12:04:49,981 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-10-13 12:04:50,171 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-10-13 12:04:50,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:50,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1204273177, now seen corresponding path program 1 times [2024-10-13 12:04:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870222227] [2024-10-13 12:04:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:50,175 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-10-13 12:04:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:50,178 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-10-13 12:04:50,179 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-10-13 12:04:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:50,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:04:50,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:50,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:04:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:50,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870222227] [2024-10-13 12:04:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870222227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:04:50,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:04:50,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 12:04:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221777581] [2024-10-13 12:04:50,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:04:50,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:04:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:04:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:04:50,488 INFO L87 Difference]: Start difference. First operand 1080 states and 1153 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:04:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:51,786 INFO L93 Difference]: Finished difference Result 1089 states and 1168 transitions. [2024-10-13 12:04:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:04:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-10-13 12:04:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:51,789 INFO L225 Difference]: With dead ends: 1089 [2024-10-13 12:04:51,789 INFO L226 Difference]: Without dead ends: 1089 [2024-10-13 12:04:51,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:04:51,790 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 4 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:51,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4846 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 12:04:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-10-13 12:04:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1088. [2024-10-13 12:04:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 586 states have (on average 1.931740614334471) internal successors, (1132), 1078 states have internal predecessors, (1132), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 12:04:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1166 transitions. [2024-10-13 12:04:51,807 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1166 transitions. Word has length 60 [2024-10-13 12:04:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:51,808 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1166 transitions. [2024-10-13 12:04:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:04:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1166 transitions. [2024-10-13 12:04:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 12:04:51,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:51,812 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:51,824 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-10-13 12:04:52,013 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-10-13 12:04:52,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1454574914, now seen corresponding path program 2 times [2024-10-13 12:04:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663485358] [2024-10-13 12:04:52,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:04:52,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-10-13 12:04:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:52,018 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-10-13 12:04:52,019 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-10-13 12:04:52,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:04:52,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:04:52,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:04:52,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:52,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:04:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:52,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663485358] [2024-10-13 12:04:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663485358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:04:52,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:04:52,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 12:04:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579085945] [2024-10-13 12:04:52,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:04:52,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:04:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:52,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:04:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:04:52,587 INFO L87 Difference]: Start difference. First operand 1088 states and 1166 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:04:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:54,910 INFO L93 Difference]: Finished difference Result 1100 states and 1186 transitions. [2024-10-13 12:04:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:04:54,910 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-10-13 12:04:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:54,914 INFO L225 Difference]: With dead ends: 1100 [2024-10-13 12:04:54,914 INFO L226 Difference]: Without dead ends: 1098 [2024-10-13 12:04:54,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:04:54,915 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 7 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8726 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:54,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8726 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 12:04:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-10-13 12:04:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1097. [2024-10-13 12:04:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 595 states have (on average 1.9226890756302522) internal successors, (1144), 1087 states have internal predecessors, (1144), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 12:04:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1178 transitions. [2024-10-13 12:04:54,933 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1178 transitions. Word has length 63 [2024-10-13 12:04:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:54,933 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1178 transitions. [2024-10-13 12:04:54,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:04:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1178 transitions. [2024-10-13 12:04:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 12:04:54,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:54,934 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:54,945 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-10-13 12:04:55,135 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-10-13 12:04:55,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:04:55,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1368824610, now seen corresponding path program 3 times [2024-10-13 12:04:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769739593] [2024-10-13 12:04:55,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:04:55,136 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-10-13 12:04:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:55,137 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-10-13 12:04:55,138 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-10-13 12:04:55,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 12:04:55,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:04:55,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:04:55,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:55,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:04:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:56,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769739593] [2024-10-13 12:04:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769739593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:04:56,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:04:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 12:04:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263662263] [2024-10-13 12:04:56,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:04:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:04:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:04:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:04:56,345 INFO L87 Difference]: Start difference. First operand 1097 states and 1178 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:05:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:05:00,622 INFO L93 Difference]: Finished difference Result 1118 states and 1214 transitions. [2024-10-13 12:05:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 12:05:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-13 12:05:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:05:00,626 INFO L225 Difference]: With dead ends: 1118 [2024-10-13 12:05:00,626 INFO L226 Difference]: Without dead ends: 1115 [2024-10-13 12:05:00,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 12:05:00,627 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 13 mSDsluCounter, 10666 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11638 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:05:00,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11638 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 12:05:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-13 12:05:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-13 12:05:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 613 states have (on average 1.9037520391517129) internal successors, (1167), 1105 states have internal predecessors, (1167), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 12:05:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1201 transitions. [2024-10-13 12:05:00,644 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1201 transitions. Word has length 69 [2024-10-13 12:05:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:05:00,644 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1201 transitions. [2024-10-13 12:05:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:05:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1201 transitions. [2024-10-13 12:05:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 12:05:00,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:05:00,646 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:05:00,660 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 (17)] Forceful destruction successful, exit code 0 [2024-10-13 12:05:00,846 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-10-13 12:05:00,847 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:05:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:05:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 166592226, now seen corresponding path program 4 times [2024-10-13 12:05:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:05:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561706266] [2024-10-13 12:05:00,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:05:00,848 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-10-13 12:05:00,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:05:00,852 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-10-13 12:05:00,853 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-10-13 12:05:01,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:05:01,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:05:01,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:05:01,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:05:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:05:01,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:05:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:05:02,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:05:02,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561706266] [2024-10-13 12:05:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561706266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:05:02,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:05:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 12:05:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141800144] [2024-10-13 12:05:02,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:05:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 12:05:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:05:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 12:05:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 12:05:02,863 INFO L87 Difference]: Start difference. First operand 1115 states and 1201 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:05:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:05:12,322 INFO L93 Difference]: Finished difference Result 1152 states and 1271 transitions. [2024-10-13 12:05:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 12:05:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-13 12:05:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:05:12,328 INFO L225 Difference]: With dead ends: 1152 [2024-10-13 12:05:12,328 INFO L226 Difference]: Without dead ends: 1150 [2024-10-13 12:05:12,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 12:05:12,330 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 25 mSDsluCounter, 22310 mSDsCounter, 0 mSdLazyCounter, 5015 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23282 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:05:12,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23282 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 5015 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-13 12:05:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-10-13 12:05:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1149. [2024-10-13 12:05:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 647 states have (on average 1.8748068006182381) internal successors, (1213), 1139 states have internal predecessors, (1213), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 12:05:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1247 transitions. [2024-10-13 12:05:12,349 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1247 transitions. Word has length 81 [2024-10-13 12:05:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:05:12,350 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1247 transitions. [2024-10-13 12:05:12,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:05:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1247 transitions. [2024-10-13 12:05:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 12:05:12,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:05:12,351 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:05:12,366 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 (18)] Forceful destruction successful, exit code 0 [2024-10-13 12:05:12,551 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-10-13 12:05:12,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-13 12:05:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:05:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 151378370, now seen corresponding path program 5 times [2024-10-13 12:05:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:05:12,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666110378] [2024-10-13 12:05:12,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:05:12,553 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-10-13 12:05:12,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:05:12,555 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-10-13 12:05:12,556 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-10-13 12:05:13,791 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 12:05:13,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:05:13,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 12:05:13,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:05:13,842 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 12:05:13,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-13 12:05:14,239 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-13 12:05:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-13 12:05:14,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:05:14,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-13 12:05:16,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 12:05:16,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 12:05:17,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-13 12:05:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 12:05:17,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:05:17,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-13 12:05:17,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:05:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666110378] [2024-10-13 12:05:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666110378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:05:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681798963] [2024-10-13 12:05:17,422 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:05:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 12:05:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 12:05:17,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 12:05:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process