./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:18:18,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:18:19,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:18:19,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:18:19,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:18:19,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:18:19,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:18:19,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:18:19,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:18:19,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:18:19,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:18:19,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:18:19,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:18:19,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:18:19,092 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:18:19,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:18:19,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:18:19,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:18:19,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:18:19,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:18:19,093 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:18:19,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:18:19,098 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:18:19,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:18:19,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:18:19,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:18:19,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:18:19,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:18:19,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:18:19,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:18:19,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:18:19,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:18:19,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:18:19,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:19,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:18:19,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:18:19,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:18:19,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:18:19,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:18:19,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:18:19,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:18:19,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:18:19,104 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-09 10:18:19,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:18:19,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:18:19,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:18:19,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:18:19,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:18:19,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-09 10:18:20,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:18:21,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:18:21,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-09 10:18:21,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bef7088/fa0b6fa02c9a44eeb580e652def19715/FLAG3099b800a [2024-11-09 10:18:21,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bef7088/fa0b6fa02c9a44eeb580e652def19715 [2024-11-09 10:18:21,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:18:21,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:18:21,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:21,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:18:21,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:18:21,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:21" (1/1) ... [2024-11-09 10:18:21,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f2cf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:21, skipping insertion in model container [2024-11-09 10:18:21,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:21" (1/1) ... [2024-11-09 10:18:21,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:21,963 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,005 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,010 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,016 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,023 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,062 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,075 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,076 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,078 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,082 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:22,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:22,113 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 10:18:22,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d8caa9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:22, skipping insertion in model container [2024-11-09 10:18:22,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:22,114 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:18:22,115 INFO L158 Benchmark]: Toolchain (without parser) took 797.47ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 77.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:18:22,115 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:18:22,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.01ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 77.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:18:22,117 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.19ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.01ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 77.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:18:24,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:18:24,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:18:24,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:18:24,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:18:24,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:18:24,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:18:24,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:18:24,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:18:24,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:18:24,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:18:24,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:18:24,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:18:24,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:18:24,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:18:24,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:18:24,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:18:24,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:18:24,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:18:24,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:18:24,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:18:24,341 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:18:24,342 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:18:24,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:18:24,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:18:24,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:18:24,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:18:24,343 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:18:24,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:18:24,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:18:24,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:18:24,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:18:24,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:18:24,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:18:24,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:18:24,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:24,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:18:24,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:18:24,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:18:24,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:18:24,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:18:24,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:18:24,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:18:24,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:18:24,349 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-09 10:18:24,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:18:24,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:18:24,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:18:24,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:18:24,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:18:24,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-09 10:18:26,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:18:26,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:18:26,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-09 10:18:26,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c9795be/0faaad995b19451689eb1c194e5bdf0a/FLAG644223fd4 [2024-11-09 10:18:26,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c9795be/0faaad995b19451689eb1c194e5bdf0a [2024-11-09 10:18:26,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:18:26,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:18:26,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:26,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:18:26,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:18:26,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:26" (1/1) ... [2024-11-09 10:18:26,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16de3651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:26, skipping insertion in model container [2024-11-09 10:18:26,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:18:26" (1/1) ... [2024-11-09 10:18:26,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:27,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,419 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,423 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,476 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,476 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,479 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,482 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:27,523 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:18:27,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:18:27,562 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,584 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,593 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,616 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,617 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,618 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,619 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,621 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,623 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,632 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,635 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:18:27,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:27,648 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:18:27,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:18:27,817 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:18:27,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27 WrapperNode [2024-11-09 10:18:27,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:18:27,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:18:27,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:18:27,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:18:27,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:27,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:27,956 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1078 [2024-11-09 10:18:27,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:18:27,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:18:27,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:18:27,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:18:27,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:27,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:27,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,065 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2024-11-09 10:18:28,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:18:28,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:18:28,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:18:28,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:18:28,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (1/1) ... [2024-11-09 10:18:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:18:28,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:18:28,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:18:28,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:18:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:18:28,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:18:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:18:28,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:18:28,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:18:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:18:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:18:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-09 10:18:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-09 10:18:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:18:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:18:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-09 10:18:28,277 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:18:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:18:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-09 10:18:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-09 10:18:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:18:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:18:28,547 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:18:28,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:18:32,348 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-09 10:18:32,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:18:32,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:18:32,404 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 10:18:32,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:18:32 BoogieIcfgContainer [2024-11-09 10:18:32,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:18:32,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:18:32,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:18:32,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:18:32,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:18:26" (1/3) ... [2024-11-09 10:18:32,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47267c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:18:32, skipping insertion in model container [2024-11-09 10:18:32,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:18:27" (2/3) ... [2024-11-09 10:18:32,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47267c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:18:32, skipping insertion in model container [2024-11-09 10:18:32,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:18:32" (3/3) ... [2024-11-09 10:18:32,418 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2024-11-09 10:18:32,435 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:18:32,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-11-09 10:18:32,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:18:32,527 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;@558db004, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:18:32,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-11-09 10:18:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 10:18:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:18:32,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:32,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:18:32,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-09 10:18:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:32,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148790010] [2024-11-09 10:18:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:32,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:32,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:18:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:32,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:32,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:32,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:32,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:32,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148790010] [2024-11-09 10:18:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148790010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:18:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858538817] [2024-11-09 10:18:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:32,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:32,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:32,871 INFO L87 Difference]: Start difference. First operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:34,378 INFO L93 Difference]: Finished difference Result 1165 states and 1235 transitions. [2024-11-09 10:18:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:18:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:34,399 INFO L225 Difference]: With dead ends: 1165 [2024-11-09 10:18:34,399 INFO L226 Difference]: Without dead ends: 1163 [2024-11-09 10:18:34,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:34,404 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 720 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:34,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1042 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:18:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-09 10:18:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1106. [2024-11-09 10:18:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 576 states have (on average 2.0572916666666665) internal successors, (1185), 1088 states have internal predecessors, (1185), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1215 transitions. [2024-11-09 10:18:34,487 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1215 transitions. Word has length 3 [2024-11-09 10:18:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:34,487 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1215 transitions. [2024-11-09 10:18:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1215 transitions. [2024-11-09 10:18:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:18:34,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:34,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:18:34,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:18:34,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:34,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:34,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-09 10:18:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763236921] [2024-11-09 10:18:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:34,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:18:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:34,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:18:34,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:34,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:34,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:34,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:34,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763236921] [2024-11-09 10:18:34,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763236921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:34,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:34,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:18:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302176594] [2024-11-09 10:18:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:34,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:34,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:34,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:34,876 INFO L87 Difference]: Start difference. First operand 1106 states and 1215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:36,723 INFO L93 Difference]: Finished difference Result 1510 states and 1656 transitions. [2024-11-09 10:18:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:18:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:36,730 INFO L225 Difference]: With dead ends: 1510 [2024-11-09 10:18:36,730 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 10:18:36,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:36,731 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 428 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:36,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1538 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:18:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 10:18:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1319. [2024-11-09 10:18:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 788 states have (on average 2.0431472081218276) internal successors, (1610), 1299 states have internal predecessors, (1610), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1644 transitions. [2024-11-09 10:18:36,778 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1644 transitions. Word has length 3 [2024-11-09 10:18:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1644 transitions. [2024-11-09 10:18:36,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1644 transitions. [2024-11-09 10:18:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:18:36,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:36,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:36,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:18:36,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:36,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:36,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-09 10:18:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241340689] [2024-11-09 10:18:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:36,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:36,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:18:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:37,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:18:37,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:37,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:18:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:18:37,248 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:18:37,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:18:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:37,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:37,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241340689] [2024-11-09 10:18:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241340689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608049183] [2024-11-09 10:18:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:37,281 INFO L87 Difference]: Start difference. First operand 1319 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:40,878 INFO L93 Difference]: Finished difference Result 2025 states and 2408 transitions. [2024-11-09 10:18:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 10:18:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:40,885 INFO L225 Difference]: With dead ends: 2025 [2024-11-09 10:18:40,886 INFO L226 Difference]: Without dead ends: 2025 [2024-11-09 10:18:40,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:40,887 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 734 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:40,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1585 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 10:18:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-09 10:18:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1468. [2024-11-09 10:18:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 937 states have (on average 2.024546424759872) internal successors, (1897), 1448 states have internal predecessors, (1897), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1931 transitions. [2024-11-09 10:18:40,924 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1931 transitions. Word has length 8 [2024-11-09 10:18:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1931 transitions. [2024-11-09 10:18:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1931 transitions. [2024-11-09 10:18:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:18:40,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:40,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:40,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:41,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:41,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-09 10:18:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:41,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045384694] [2024-11-09 10:18:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:41,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:41,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:18:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:41,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:18:41,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:41,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:41,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:41,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045384694] [2024-11-09 10:18:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045384694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627714024] [2024-11-09 10:18:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:41,311 INFO L87 Difference]: Start difference. First operand 1468 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:43,188 INFO L93 Difference]: Finished difference Result 2015 states and 2706 transitions. [2024-11-09 10:18:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 10:18:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:43,195 INFO L225 Difference]: With dead ends: 2015 [2024-11-09 10:18:43,195 INFO L226 Difference]: Without dead ends: 2015 [2024-11-09 10:18:43,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:43,196 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 924 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:43,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2093 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:18:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-09 10:18:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1423. [2024-11-09 10:18:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 937 states have (on average 1.961579509071505) internal successors, (1838), 1403 states have internal predecessors, (1838), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1872 transitions. [2024-11-09 10:18:43,225 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1872 transitions. Word has length 9 [2024-11-09 10:18:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:43,226 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1872 transitions. [2024-11-09 10:18:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1872 transitions. [2024-11-09 10:18:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:18:43,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:43,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:43,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:43,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-09 10:18:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891208061] [2024-11-09 10:18:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:43,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:43,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:18:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:43,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:18:43,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:43,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:43,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:43,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891208061] [2024-11-09 10:18:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891208061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987652988] [2024-11-09 10:18:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:43,624 INFO L87 Difference]: Start difference. First operand 1423 states and 1872 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:46,059 INFO L93 Difference]: Finished difference Result 2079 states and 2728 transitions. [2024-11-09 10:18:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:46,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 10:18:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:46,065 INFO L225 Difference]: With dead ends: 2079 [2024-11-09 10:18:46,066 INFO L226 Difference]: Without dead ends: 2079 [2024-11-09 10:18:46,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:46,067 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 704 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:46,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2448 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 10:18:46,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-09 10:18:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1415. [2024-11-09 10:18:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 939 states have (on average 1.933972310969116) internal successors, (1816), 1395 states have internal predecessors, (1816), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1850 transitions. [2024-11-09 10:18:46,113 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1850 transitions. Word has length 9 [2024-11-09 10:18:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:46,113 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1850 transitions. [2024-11-09 10:18:46,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1850 transitions. [2024-11-09 10:18:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:18:46,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:46,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:46,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:46,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:46,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash -325578228, now seen corresponding path program 1 times [2024-11-09 10:18:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831352815] [2024-11-09 10:18:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:46,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:46,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:46,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:18:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:46,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:18:46,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:46,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:46,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:46,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831352815] [2024-11-09 10:18:46,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831352815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:46,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:46,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136333275] [2024-11-09 10:18:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:46,520 INFO L87 Difference]: Start difference. First operand 1415 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:46,955 INFO L93 Difference]: Finished difference Result 1863 states and 2408 transitions. [2024-11-09 10:18:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:46,955 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:18:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:46,961 INFO L225 Difference]: With dead ends: 1863 [2024-11-09 10:18:46,961 INFO L226 Difference]: Without dead ends: 1863 [2024-11-09 10:18:46,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:46,963 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 455 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:46,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3195 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:18:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-09 10:18:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1671. [2024-11-09 10:18:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1195 states have (on average 1.9489539748953975) internal successors, (2329), 1651 states have internal predecessors, (2329), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2363 transitions. [2024-11-09 10:18:46,999 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2363 transitions. Word has length 13 [2024-11-09 10:18:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:46,999 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2363 transitions. [2024-11-09 10:18:46,999 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2363 transitions. [2024-11-09 10:18:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:18:47,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:47,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:47,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:18:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:47,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-09 10:18:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384212409] [2024-11-09 10:18:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:47,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:47,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:18:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:47,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:18:47,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:47,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:47,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384212409] [2024-11-09 10:18:47,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384212409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:47,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829554144] [2024-11-09 10:18:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:47,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:47,365 INFO L87 Difference]: Start difference. First operand 1671 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:47,400 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2024-11-09 10:18:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:47,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:18:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:47,406 INFO L225 Difference]: With dead ends: 1575 [2024-11-09 10:18:47,406 INFO L226 Difference]: Without dead ends: 1575 [2024-11-09 10:18:47,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:47,408 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 71 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:47,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-09 10:18:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-09 10:18:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1123 states have (on average 1.9207479964381122) internal successors, (2157), 1555 states have internal predecessors, (2157), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:18:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-11-09 10:18:47,438 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 13 [2024-11-09 10:18:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:47,438 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-11-09 10:18:47,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-11-09 10:18:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:18:47,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:47,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:47,444 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-11-09 10:18:47,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:47,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:47,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1373575884, now seen corresponding path program 1 times [2024-11-09 10:18:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361668476] [2024-11-09 10:18:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:47,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:47,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:47,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:18:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:47,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:18:47,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:47,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:18:47,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:18:47,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:18:47,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 10:18:47,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:18:47,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 10:18:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:47,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:47,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361668476] [2024-11-09 10:18:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361668476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:47,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580144207] [2024-11-09 10:18:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:47,892 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:48,163 INFO L93 Difference]: Finished difference Result 2100 states and 2505 transitions. [2024-11-09 10:18:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 10:18:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:48,169 INFO L225 Difference]: With dead ends: 2100 [2024-11-09 10:18:48,170 INFO L226 Difference]: Without dead ends: 2100 [2024-11-09 10:18:48,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:48,170 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 899 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:48,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2985 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:18:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-09 10:18:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1240. [2024-11-09 10:18:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 790 states have (on average 1.9037974683544303) internal successors, (1504), 1222 states have internal predecessors, (1504), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1534 transitions. [2024-11-09 10:18:48,203 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1534 transitions. Word has length 16 [2024-11-09 10:18:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:48,203 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1534 transitions. [2024-11-09 10:18:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1534 transitions. [2024-11-09 10:18:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:18:48,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:48,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:48,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:18:48,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-09 10:18:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333201745] [2024-11-09 10:18:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:48,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:48,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:18:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:48,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:18:48,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:48,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:48,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333201745] [2024-11-09 10:18:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333201745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:18:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119419858] [2024-11-09 10:18:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:18:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:18:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:48,585 INFO L87 Difference]: Start difference. First operand 1240 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:48,618 INFO L93 Difference]: Finished difference Result 1180 states and 1448 transitions. [2024-11-09 10:18:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:18:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-09 10:18:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:48,622 INFO L225 Difference]: With dead ends: 1180 [2024-11-09 10:18:48,622 INFO L226 Difference]: Without dead ends: 1180 [2024-11-09 10:18:48,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:18:48,623 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 71 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:48,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1885 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-09 10:18:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-11-09 10:18:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 754 states have (on average 1.8806366047745358) internal successors, (1418), 1162 states have internal predecessors, (1418), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1448 transitions. [2024-11-09 10:18:48,640 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1448 transitions. Word has length 19 [2024-11-09 10:18:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1448 transitions. [2024-11-09 10:18:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1448 transitions. [2024-11-09 10:18:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:18:48,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:48,641 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] [2024-11-09 10:18:48,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:18:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-09 10:18:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214182067] [2024-11-09 10:18:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:48,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:48,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:48,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:18:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:49,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:49,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:49,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:49,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:49,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214182067] [2024-11-09 10:18:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214182067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143134396] [2024-11-09 10:18:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:49,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:49,031 INFO L87 Difference]: Start difference. First operand 1180 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:49,097 INFO L93 Difference]: Finished difference Result 1150 states and 1390 transitions. [2024-11-09 10:18:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-09 10:18:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:49,100 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:18:49,100 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:18:49,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:49,101 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 48 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:49,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2761 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:18:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-09 10:18:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 738 states have (on average 1.8428184281842819) internal successors, (1360), 1132 states have internal predecessors, (1360), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1390 transitions. [2024-11-09 10:18:49,125 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1390 transitions. Word has length 21 [2024-11-09 10:18:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1390 transitions. [2024-11-09 10:18:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1390 transitions. [2024-11-09 10:18:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:18:49,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:49,127 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] [2024-11-09 10:18:49,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:18:49,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:49,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-09 10:18:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316245808] [2024-11-09 10:18:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:49,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:49,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:49,332 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:49,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:18:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:49,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:18:49,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:49,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:18:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:49,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:49,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316245808] [2024-11-09 10:18:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316245808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:49,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999767856] [2024-11-09 10:18:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:49,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:18:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:18:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:49,700 INFO L87 Difference]: Start difference. First operand 1150 states and 1390 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:52,242 INFO L93 Difference]: Finished difference Result 1703 states and 2070 transitions. [2024-11-09 10:18:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:18:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-09 10:18:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:52,247 INFO L225 Difference]: With dead ends: 1703 [2024-11-09 10:18:52,247 INFO L226 Difference]: Without dead ends: 1703 [2024-11-09 10:18:52,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:18:52,248 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 594 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:52,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3121 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:18:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-09 10:18:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1146. [2024-11-09 10:18:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 738 states have (on average 1.8319783197831978) internal successors, (1352), 1128 states have internal predecessors, (1352), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1382 transitions. [2024-11-09 10:18:52,264 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1382 transitions. Word has length 35 [2024-11-09 10:18:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:52,264 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1382 transitions. [2024-11-09 10:18:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1382 transitions. [2024-11-09 10:18:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:18:52,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:52,266 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] [2024-11-09 10:18:52,272 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-11-09 10:18:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:52,466 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-09 10:18:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237762358] [2024-11-09 10:18:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:52,469 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:52,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:18:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:52,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:18:52,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:52,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:18:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:52,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:52,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:52,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237762358] [2024-11-09 10:18:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237762358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:52,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939961451] [2024-11-09 10:18:52,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:52,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:18:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:18:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:52,714 INFO L87 Difference]: Start difference. First operand 1146 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:54,649 INFO L93 Difference]: Finished difference Result 1572 states and 1929 transitions. [2024-11-09 10:18:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:18:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-09 10:18:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:54,654 INFO L225 Difference]: With dead ends: 1572 [2024-11-09 10:18:54,654 INFO L226 Difference]: Without dead ends: 1572 [2024-11-09 10:18:54,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:18:54,654 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 810 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:54,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:18:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-09 10:18:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1142. [2024-11-09 10:18:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 738 states have (on average 1.8211382113821137) internal successors, (1344), 1124 states have internal predecessors, (1344), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1374 transitions. [2024-11-09 10:18:54,674 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1374 transitions. Word has length 35 [2024-11-09 10:18:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:54,675 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1374 transitions. [2024-11-09 10:18:54,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1374 transitions. [2024-11-09 10:18:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 10:18:54,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:54,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:54,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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:18:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:54,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 103689706, now seen corresponding path program 1 times [2024-11-09 10:18:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558324218] [2024-11-09 10:18:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:54,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:54,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:54,884 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:54,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:18:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:55,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:18:55,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:55,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:55,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558324218] [2024-11-09 10:18:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558324218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:55,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309124752] [2024-11-09 10:18:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:55,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:18:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:18:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:18:55,183 INFO L87 Difference]: Start difference. First operand 1142 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:55,240 INFO L93 Difference]: Finished difference Result 1130 states and 1354 transitions. [2024-11-09 10:18:55,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:18:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 10:18:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:55,243 INFO L225 Difference]: With dead ends: 1130 [2024-11-09 10:18:55,243 INFO L226 Difference]: Without dead ends: 1130 [2024-11-09 10:18:55,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:18:55,244 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 21 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:55,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2738 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:18:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-09 10:18:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-09 10:18:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 726 states have (on average 1.8236914600550964) internal successors, (1324), 1112 states have internal predecessors, (1324), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:18:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1354 transitions. [2024-11-09 10:18:55,259 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1354 transitions. Word has length 55 [2024-11-09 10:18:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:55,259 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1354 transitions. [2024-11-09 10:18:55,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1354 transitions. [2024-11-09 10:18:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:18:55,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:55,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:55,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:18:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:55,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -636164170, now seen corresponding path program 1 times [2024-11-09 10:18:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234161119] [2024-11-09 10:18:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:55,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:55,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:55,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:55,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:18:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:55,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:18:55,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:55,854 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-09 10:18:55,854 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 16 treesize of output 17 [2024-11-09 10:18:55,918 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 10:18:55,919 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 18 treesize of output 28 [2024-11-09 10:18:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:18:56,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:18:56,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:18:56,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234161119] [2024-11-09 10:18:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234161119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:18:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:18:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:18:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995161503] [2024-11-09 10:18:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:18:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:18:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:18:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:18:56,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:18:56,325 INFO L87 Difference]: Start difference. First operand 1130 states and 1354 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:58,520 INFO L93 Difference]: Finished difference Result 2053 states and 2462 transitions. [2024-11-09 10:18:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:18:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-09 10:18:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:58,525 INFO L225 Difference]: With dead ends: 2053 [2024-11-09 10:18:58,525 INFO L226 Difference]: Without dead ends: 2053 [2024-11-09 10:18:58,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:18:58,526 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 793 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:58,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2138 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:18:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-09 10:18:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1561. [2024-11-09 10:18:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1142 states have (on average 1.816987740805604) internal successors, (2075), 1531 states have internal predecessors, (2075), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 10:18:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2129 transitions. [2024-11-09 10:18:58,550 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2129 transitions. Word has length 63 [2024-11-09 10:18:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2129 transitions. [2024-11-09 10:18:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:18:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2129 transitions. [2024-11-09 10:18:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:18:58,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:58,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:58,564 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 (15)] Ended with exit code 0 [2024-11-09 10:18:58,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:58,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:18:58,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -636164169, now seen corresponding path program 1 times [2024-11-09 10:18:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:18:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630350739] [2024-11-09 10:18:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:58,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:18:58,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:18:58,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:18:58,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:18:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:59,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:18:59,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:59,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:18:59,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:18:59,334 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 10:18:59,335 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 14 [2024-11-09 10:19:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:00,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:00,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630350739] [2024-11-09 10:19:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630350739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:19:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648445475] [2024-11-09 10:19:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:19:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:00,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:19:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:19:00,044 INFO L87 Difference]: Start difference. First operand 1561 states and 2129 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:19:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:01,748 INFO L93 Difference]: Finished difference Result 1566 states and 2135 transitions. [2024-11-09 10:19:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:19:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-09 10:19:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:01,754 INFO L225 Difference]: With dead ends: 1566 [2024-11-09 10:19:01,754 INFO L226 Difference]: Without dead ends: 1566 [2024-11-09 10:19:01,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:19:01,755 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 58 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:01,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1947 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:19:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-09 10:19:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-09 10:19:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1146 states have (on average 1.8141361256544504) internal successors, (2079), 1535 states have internal predecessors, (2079), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 10:19:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2135 transitions. [2024-11-09 10:19:01,777 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2135 transitions. Word has length 63 [2024-11-09 10:19:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:01,777 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2135 transitions. [2024-11-09 10:19:01,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:19:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2135 transitions. [2024-11-09 10:19:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 10:19:01,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:01,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:01,790 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:19:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:01,979 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1657745720, now seen corresponding path program 1 times [2024-11-09 10:19:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008682433] [2024-11-09 10:19:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:01,981 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:01,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:19:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:02,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:19:02,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:02,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:02,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008682433] [2024-11-09 10:19:02,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008682433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:02,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:19:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88299475] [2024-11-09 10:19:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:19:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:19:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:19:02,314 INFO L87 Difference]: Start difference. First operand 1566 states and 2135 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:19:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:02,398 INFO L93 Difference]: Finished difference Result 1592 states and 2162 transitions. [2024-11-09 10:19:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:19:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-09 10:19:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:02,404 INFO L225 Difference]: With dead ends: 1592 [2024-11-09 10:19:02,404 INFO L226 Difference]: Without dead ends: 1592 [2024-11-09 10:19:02,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:19:02,405 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 15 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:02,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4660 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:19:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-09 10:19:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2024-11-09 10:19:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1164 states have (on average 1.8058419243986255) internal successors, (2102), 1555 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 10:19:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2162 transitions. [2024-11-09 10:19:02,451 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2162 transitions. Word has length 71 [2024-11-09 10:19:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2162 transitions. [2024-11-09 10:19:02,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:19:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2162 transitions. [2024-11-09 10:19:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:19:02,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:02,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:02,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:19:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:02,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:02,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 949549232, now seen corresponding path program 1 times [2024-11-09 10:19:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178746570] [2024-11-09 10:19:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:02,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:02,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:02,656 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:02,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:19:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:02,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:19:02,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:03,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:03,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178746570] [2024-11-09 10:19:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178746570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:03,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:19:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318035352] [2024-11-09 10:19:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:19:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:19:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:19:03,064 INFO L87 Difference]: Start difference. First operand 1590 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:19:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:03,313 INFO L93 Difference]: Finished difference Result 1602 states and 2176 transitions. [2024-11-09 10:19:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:19:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-09 10:19:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:03,320 INFO L225 Difference]: With dead ends: 1602 [2024-11-09 10:19:03,320 INFO L226 Difference]: Without dead ends: 1602 [2024-11-09 10:19:03,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:19:03,321 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:03,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:19:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-09 10:19:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1593. [2024-11-09 10:19:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1166 states have (on average 1.804459691252144) internal successors, (2104), 1557 states have internal predecessors, (2104), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:19:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2165 transitions. [2024-11-09 10:19:03,358 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2165 transitions. Word has length 69 [2024-11-09 10:19:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:03,358 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2165 transitions. [2024-11-09 10:19:03,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:19:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2165 transitions. [2024-11-09 10:19:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:19:03,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:03,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:03,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 10:19:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:03,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:03,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141160, now seen corresponding path program 1 times [2024-11-09 10:19:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:03,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283176927] [2024-11-09 10:19:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:03,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:03,563 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:03,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:19:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:03,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:19:03,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:19:04,090 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-09 10:19:04,122 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:19:04,122 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 14 treesize of output 20 [2024-11-09 10:19:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:04,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:04,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283176927] [2024-11-09 10:19:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283176927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:04,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:04,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:19:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766282354] [2024-11-09 10:19:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:04,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:19:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:19:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-09 10:19:04,137 INFO L87 Difference]: Start difference. First operand 1593 states and 2165 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:06,380 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2024-11-09 10:19:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:19:06,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-09 10:19:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:06,387 INFO L225 Difference]: With dead ends: 2014 [2024-11-09 10:19:06,387 INFO L226 Difference]: Without dead ends: 2014 [2024-11-09 10:19:06,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-09 10:19:06,388 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 771 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:06,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1651 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1609 Invalid, 0 Unknown, 1326 Unchecked, 2.2s Time] [2024-11-09 10:19:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-09 10:19:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1592. [2024-11-09 10:19:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1166 states have (on average 1.8027444253859348) internal successors, (2102), 1556 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:19:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2163 transitions. [2024-11-09 10:19:06,423 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2163 transitions. Word has length 74 [2024-11-09 10:19:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2163 transitions. [2024-11-09 10:19:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2163 transitions. [2024-11-09 10:19:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:19:06,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:06,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:06,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 10:19:06,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:06,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141161, now seen corresponding path program 1 times [2024-11-09 10:19:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995743045] [2024-11-09 10:19:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:06,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:06,633 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:06,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:19:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:07,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:19:07,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:07,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:19:07,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:19:07,527 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-09 10:19:07,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:19:07,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:19:07,564 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:19:07,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:19:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:07,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:07,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995743045] [2024-11-09 10:19:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995743045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:07,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:19:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639182589] [2024-11-09 10:19:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:19:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:19:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-09 10:19:07,586 INFO L87 Difference]: Start difference. First operand 1592 states and 2163 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:11,480 INFO L93 Difference]: Finished difference Result 2690 states and 3619 transitions. [2024-11-09 10:19:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:19:11,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-09 10:19:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:11,491 INFO L225 Difference]: With dead ends: 2690 [2024-11-09 10:19:11,491 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 10:19:11,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-09 10:19:11,492 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 1477 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:11,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2410 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2964 Invalid, 0 Unknown, 1810 Unchecked, 3.8s Time] [2024-11-09 10:19:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 10:19:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 1584. [2024-11-09 10:19:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1166 states have (on average 1.7890222984562607) internal successors, (2086), 1548 states have internal predecessors, (2086), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:19:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2147 transitions. [2024-11-09 10:19:11,538 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2147 transitions. Word has length 74 [2024-11-09 10:19:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2147 transitions. [2024-11-09 10:19:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2147 transitions. [2024-11-09 10:19:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:19:11,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:11,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:11,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 10:19:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:11,741 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2023437919, now seen corresponding path program 1 times [2024-11-09 10:19:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:11,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141397945] [2024-11-09 10:19:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:11,743 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:11,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 10:19:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:12,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:19:12,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:19:12,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:19:12,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:19:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:12,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:12,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141397945] [2024-11-09 10:19:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141397945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:12,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:19:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575735812] [2024-11-09 10:19:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:19:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:12,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:19:12,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:19:12,184 INFO L87 Difference]: Start difference. First operand 1584 states and 2147 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:19:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:14,829 INFO L93 Difference]: Finished difference Result 1599 states and 2163 transitions. [2024-11-09 10:19:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:19:14,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-09 10:19:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:14,834 INFO L225 Difference]: With dead ends: 1599 [2024-11-09 10:19:14,834 INFO L226 Difference]: Without dead ends: 1599 [2024-11-09 10:19:14,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:19:14,835 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 16 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:14,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4000 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 10:19:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-09 10:19:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1598. [2024-11-09 10:19:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7843803056027165) internal successors, (2102), 1560 states have internal predecessors, (2102), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:19:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2163 transitions. [2024-11-09 10:19:14,869 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2163 transitions. Word has length 81 [2024-11-09 10:19:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:14,870 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2163 transitions. [2024-11-09 10:19:14,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:19:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2163 transitions. [2024-11-09 10:19:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 10:19:14,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:14,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:14,883 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 (21)] Ended with exit code 0 [2024-11-09 10:19:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:15,073 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1697934027, now seen corresponding path program 1 times [2024-11-09 10:19:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723835557] [2024-11-09 10:19:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:15,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:15,075 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:15,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 10:19:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:15,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:19:15,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:15,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:19:15,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:19:15,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:19:15,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 10:19:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:15,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:15,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723835557] [2024-11-09 10:19:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723835557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:19:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867857674] [2024-11-09 10:19:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:19:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:15,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:19:15,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:19:15,574 INFO L87 Difference]: Start difference. First operand 1598 states and 2163 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:18,985 INFO L93 Difference]: Finished difference Result 1598 states and 2161 transitions. [2024-11-09 10:19:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:19:18,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-09 10:19:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:18,989 INFO L225 Difference]: With dead ends: 1598 [2024-11-09 10:19:18,989 INFO L226 Difference]: Without dead ends: 1598 [2024-11-09 10:19:18,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:19:18,990 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 13 mSDsluCounter, 3837 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:18,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4753 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 10:19:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-09 10:19:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-11-09 10:19:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7826825127334465) internal successors, (2100), 1560 states have internal predecessors, (2100), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:19:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2161 transitions. [2024-11-09 10:19:19,019 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2161 transitions. Word has length 82 [2024-11-09 10:19:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:19,020 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2161 transitions. [2024-11-09 10:19:19,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:19:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2161 transitions. [2024-11-09 10:19:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:19:19,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:19,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:19,033 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 (22)] Forceful destruction successful, exit code 0 [2024-11-09 10:19:19,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:19,222 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1028513902, now seen corresponding path program 1 times [2024-11-09 10:19:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971326390] [2024-11-09 10:19:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:19,225 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:19,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 10:19:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:19,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:19:19,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:19,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:19:19,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971326390] [2024-11-09 10:19:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971326390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:19:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:19:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:19:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278662018] [2024-11-09 10:19:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:19:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:19:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:19:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:19:19,605 INFO L87 Difference]: Start difference. First operand 1598 states and 2161 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 10:19:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:19,649 INFO L93 Difference]: Finished difference Result 1614 states and 2179 transitions. [2024-11-09 10:19:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:19:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-09 10:19:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:19,653 INFO L225 Difference]: With dead ends: 1614 [2024-11-09 10:19:19,653 INFO L226 Difference]: Without dead ends: 1608 [2024-11-09 10:19:19,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:19:19,654 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:19,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:19:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-09 10:19:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-09 10:19:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1186 states have (on average 1.779089376053963) internal successors, (2110), 1570 states have internal predecessors, (2110), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:19:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2173 transitions. [2024-11-09 10:19:19,679 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2173 transitions. Word has length 89 [2024-11-09 10:19:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:19,680 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2173 transitions. [2024-11-09 10:19:19,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 10:19:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2173 transitions. [2024-11-09 10:19:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:19:19,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:19,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:19,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-09 10:19:19,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:19,882 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash -659854572, now seen corresponding path program 1 times [2024-11-09 10:19:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:19,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207669012] [2024-11-09 10:19:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:19:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:19,887 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:19,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 10:19:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:19:20,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:19:20,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:20,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:19:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:20,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207669012] [2024-11-09 10:19:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207669012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:19:20,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:19:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 10:19:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623077728] [2024-11-09 10:19:20,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:19:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:19:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:20,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:19:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:19:20,410 INFO L87 Difference]: Start difference. First operand 1608 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:20,549 INFO L93 Difference]: Finished difference Result 1634 states and 2203 transitions. [2024-11-09 10:19:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:19:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-09 10:19:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:20,554 INFO L225 Difference]: With dead ends: 1634 [2024-11-09 10:19:20,554 INFO L226 Difference]: Without dead ends: 1622 [2024-11-09 10:19:20,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:19:20,555 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:20,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3688 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:19:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-09 10:19:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2024-11-09 10:19:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1194 states have (on average 1.7755443886097153) internal successors, (2120), 1578 states have internal predecessors, (2120), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:19:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2183 transitions. [2024-11-09 10:19:20,584 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2183 transitions. Word has length 90 [2024-11-09 10:19:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:20,584 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2183 transitions. [2024-11-09 10:19:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2183 transitions. [2024-11-09 10:19:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:19:20,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:20,587 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:20,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 10:19:20,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:20,788 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -307340818, now seen corresponding path program 2 times [2024-11-09 10:19:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200937708] [2024-11-09 10:19:20,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:19:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:20,790 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:20,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 10:19:21,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:19:21,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:19:21,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:19:21,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:21,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:19:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:21,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200937708] [2024-11-09 10:19:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200937708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:19:21,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:19:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 10:19:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752623391] [2024-11-09 10:19:21,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:19:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:19:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:19:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:19:21,950 INFO L87 Difference]: Start difference. First operand 1616 states and 2183 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:22,477 INFO L93 Difference]: Finished difference Result 1652 states and 2233 transitions. [2024-11-09 10:19:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 10:19:22,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-09 10:19:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:22,481 INFO L225 Difference]: With dead ends: 1652 [2024-11-09 10:19:22,482 INFO L226 Difference]: Without dead ends: 1640 [2024-11-09 10:19:22,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-09 10:19:22,483 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 36 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:22,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8286 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 10:19:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-09 10:19:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1634. [2024-11-09 10:19:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1212 states have (on average 1.768976897689769) internal successors, (2144), 1596 states have internal predecessors, (2144), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:19:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2207 transitions. [2024-11-09 10:19:22,503 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2207 transitions. Word has length 93 [2024-11-09 10:19:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:22,504 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2207 transitions. [2024-11-09 10:19:22,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2207 transitions. [2024-11-09 10:19:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:19:22,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:22,505 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:22,518 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 10:19:22,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:22,706 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash -257513426, now seen corresponding path program 3 times [2024-11-09 10:19:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986892472] [2024-11-09 10:19:22,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:19:22,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:22,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:22,712 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 10:19:23,738 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:19:23,739 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:19:23,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:19:23,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:23,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:19:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:24,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986892472] [2024-11-09 10:19:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986892472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:19:24,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:19:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-09 10:19:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63456264] [2024-11-09 10:19:24,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:19:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 10:19:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 10:19:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:19:24,526 INFO L87 Difference]: Start difference. First operand 1634 states and 2207 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:26,350 INFO L93 Difference]: Finished difference Result 1688 states and 2291 transitions. [2024-11-09 10:19:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 10:19:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-09 10:19:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:26,354 INFO L225 Difference]: With dead ends: 1688 [2024-11-09 10:19:26,354 INFO L226 Difference]: Without dead ends: 1670 [2024-11-09 10:19:26,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 10:19:26,356 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 43 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12885 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:26,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12885 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:19:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-09 10:19:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-09 10:19:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1248 states have (on average 1.7548076923076923) internal successors, (2190), 1632 states have internal predecessors, (2190), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:19:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2253 transitions. [2024-11-09 10:19:26,378 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2253 transitions. Word has length 99 [2024-11-09 10:19:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:26,379 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2253 transitions. [2024-11-09 10:19:26,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2253 transitions. [2024-11-09 10:19:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 10:19:26,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:26,380 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:26,398 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 (26)] Forceful destruction successful, exit code 0 [2024-11-09 10:19:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:26,581 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:26,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 351286446, now seen corresponding path program 4 times [2024-11-09 10:19:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230419209] [2024-11-09 10:19:26,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:19:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:26,584 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:26,585 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 (27)] Waiting until timeout for monitored process [2024-11-09 10:19:27,403 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:19:27,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:19:27,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:19:27,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:27,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:19:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:19:29,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230419209] [2024-11-09 10:19:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230419209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:19:29,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:19:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 10:19:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126491553] [2024-11-09 10:19:29,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:19:29,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 10:19:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:19:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 10:19:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 10:19:29,337 INFO L87 Difference]: Start difference. First operand 1670 states and 2253 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:19:38,172 INFO L93 Difference]: Finished difference Result 1756 states and 2403 transitions. [2024-11-09 10:19:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-09 10:19:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-09 10:19:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:19:38,177 INFO L225 Difference]: With dead ends: 1756 [2024-11-09 10:19:38,177 INFO L226 Difference]: Without dead ends: 1744 [2024-11-09 10:19:38,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-09 10:19:38,180 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 101 mSDsluCounter, 22101 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 23026 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:19:38,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 23026 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:19:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-09 10:19:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1738. [2024-11-09 10:19:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1316 states have (on average 1.7340425531914894) internal successors, (2282), 1700 states have internal predecessors, (2282), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:19:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2345 transitions. [2024-11-09 10:19:38,215 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2345 transitions. Word has length 111 [2024-11-09 10:19:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:19:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2345 transitions. [2024-11-09 10:19:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:19:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2345 transitions. [2024-11-09 10:19:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 10:19:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:19:38,218 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:19:38,236 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 (27)] Ended with exit code 0 [2024-11-09 10:19:38,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:38,419 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:19:38,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:19:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2042747118, now seen corresponding path program 5 times [2024-11-09 10:19:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:19:38,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142510885] [2024-11-09 10:19:38,420 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:19:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:19:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:19:38,422 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:19:38,423 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 (28)] Waiting until timeout for monitored process [2024-11-09 10:19:39,718 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:19:39,718 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:19:39,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 10:19:39,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:19:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:19:39,950 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:19:39,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 10:19:39,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:19:40,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 10:19:41,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:19:41,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:19:41,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 10:19:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-09 10:19:41,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:19:41,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:19:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142510885] [2024-11-09 10:19:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142510885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:19:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [168347014] [2024-11-09 10:19:41,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:19:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:19:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:19:41,698 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:19:41,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process