./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test14.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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:09,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:09,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:47:09,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:09,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:09,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:09,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:09,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:09,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:09,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:09,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:09,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:09,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:09,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:09,190 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:09,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:09,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:09,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:09,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:09,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:09,192 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:09,196 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:09,196 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:09,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:09,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:09,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:09,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:09,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:09,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:09,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:09,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:09,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:09,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:09,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:09,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:09,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:09,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:47:09,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:47:09,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:09,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:09,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:09,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:09,200 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 -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2024-11-19 06:47:09,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:09,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:09,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:09,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:09,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:09,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-11-19 06:47:10,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:11,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:11,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-11-19 06:47:11,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e48c04/d07b99c21c7d4a50a5340ceb4cf9032a/FLAGb7dab7add [2024-11-19 06:47:11,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0e48c04/d07b99c21c7d4a50a5340ceb4cf9032a [2024-11-19 06:47:11,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:11,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:11,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:11,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:11,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:11,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:11" (1/1) ... [2024-11-19 06:47:11,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e8d6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:11, skipping insertion in model container [2024-11-19 06:47:11,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:11" (1/1) ... [2024-11-19 06:47:11,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:11,998 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:12,051 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:12,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:12,077 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:47:12,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d687439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:12, skipping insertion in model container [2024-11-19 06:47:12,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:12,079 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:47:12,083 INFO L158 Benchmark]: Toolchain (without parser) took 530.86ms. Allocated memory is still 161.5MB. Free memory was 88.9MB in the beginning and 127.5MB in the end (delta: -38.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:47:12,083 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:47:12,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.50ms. Allocated memory is still 161.5MB. Free memory was 88.7MB in the beginning and 127.5MB in the end (delta: -38.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:47:12,085 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.17ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.50ms. Allocated memory is still 161.5MB. Free memory was 88.7MB in the beginning and 127.5MB in the end (delta: -38.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test14.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 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:47:14,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:47:14,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:47:14,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:47:14,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:47:14,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:47:14,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:47:14,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:47:14,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:47:14,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:47:14,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:47:14,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:47:14,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:47:14,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:47:14,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:47:14,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:47:14,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:47:14,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:47:14,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:47:14,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:47:14,284 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:47:14,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:47:14,285 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:47:14,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:47:14,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:47:14,285 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:47:14,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:47:14,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:47:14,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:47:14,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:47:14,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:47:14,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:47:14,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:47:14,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:47:14,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:47:14,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:14,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:47:14,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:47:14,289 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:47:14,289 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:14,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:47:14,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:47:14,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:47:14,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:47:14,291 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 -> 57e88052da463d5b7254d94e89c581ee420b273cd207f71cae5120687b870089 [2024-11-19 06:47:14,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:47:14,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:47:14,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:47:14,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:47:14,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:47:14,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-11-19 06:47:16,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:47:16,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:47:16,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14.i [2024-11-19 06:47:16,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b13197a2/964c650e73ae4dc8a83cc7cb05b27ec4/FLAG3b3bb4955 [2024-11-19 06:47:16,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b13197a2/964c650e73ae4dc8a83cc7cb05b27ec4 [2024-11-19 06:47:16,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:47:16,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:47:16,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:16,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:47:16,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:47:16,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:16" (1/1) ... [2024-11-19 06:47:16,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f903c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:16, skipping insertion in model container [2024-11-19 06:47:16,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:47:16" (1/1) ... [2024-11-19 06:47:16,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:17,208 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:17,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:17,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:17,316 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:47:17,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:47:17,361 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:17,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:47:17,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:17,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:47:17,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:47:17,523 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:47:17,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17 WrapperNode [2024-11-19 06:47:17,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:47:17,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:17,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:47:17,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:47:17,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,586 INFO L138 Inliner]: procedures = 168, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 67 [2024-11-19 06:47:17,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:47:17,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:47:17,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:47:17,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:47:17,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,629 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 6 writes are split as follows [0, 6]. [2024-11-19 06:47:17,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:47:17,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:47:17,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:47:17,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:47:17,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (1/1) ... [2024-11-19 06:47:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:47:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:47:17,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:47:17,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:47:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 06:47:17,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 06:47:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:47:17,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:47:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-19 06:47:17,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-19 06:47:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:47:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:47:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 06:47:17,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 06:47:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:47:17,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:47:17,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:47:17,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:47:18,279 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-19 06:47:18,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:47:18,296 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:47:18,297 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:47:18,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:18 BoogieIcfgContainer [2024-11-19 06:47:18,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:47:18,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:47:18,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:47:18,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:47:18,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:47:16" (1/3) ... [2024-11-19 06:47:18,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48822ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:18, skipping insertion in model container [2024-11-19 06:47:18,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:47:17" (2/3) ... [2024-11-19 06:47:18,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48822ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:18, skipping insertion in model container [2024-11-19 06:47:18,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:18" (3/3) ... [2024-11-19 06:47:18,304 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test14.i [2024-11-19 06:47:18,318 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:47:18,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-19 06:47:18,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:47:18,373 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;@3b0293aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:47:18,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-19 06:47:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:47:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:18,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:18,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1177398999, now seen corresponding path program 1 times [2024-11-19 06:47:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357952470] [2024-11-19 06:47:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:18,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:18,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:18,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:47:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:18,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:47:18,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:18,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:18,705 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-19 06:47:18,758 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:47:18,759 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-19 06:47:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:18,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:18,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357952470] [2024-11-19 06:47:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357952470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:18,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816592785] [2024-11-19 06:47:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-19 06:47:18,850 INFO L87 Difference]: Start difference. First operand has 78 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 70 states have internal predecessors, (73), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:19,221 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-19 06:47:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:47:19,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:47:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:19,234 INFO L225 Difference]: With dead ends: 79 [2024-11-19 06:47:19,234 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 06:47:19,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:47:19,241 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:19,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 124 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2024-11-19 06:47:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 06:47:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-11-19 06:47:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 40 states have (on average 1.725) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-19 06:47:19,286 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 12 [2024-11-19 06:47:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:19,287 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-19 06:47:19,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-19 06:47:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:47:19,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:19,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:19,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:47:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:19,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:19,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1177398998, now seen corresponding path program 1 times [2024-11-19 06:47:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:19,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349617589] [2024-11-19 06:47:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:19,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:19,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:19,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:19,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:47:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:19,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:47:19,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:19,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:19,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:19,716 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:47:19,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:19,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:19,795 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:19,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:19,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:19,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349617589] [2024-11-19 06:47:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349617589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:47:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085875646] [2024-11-19 06:47:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:19,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:47:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:19,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:47:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:47:19,894 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:20,265 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-19 06:47:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:47:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:20,268 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:47:20,268 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:47:20,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-19 06:47:20,273 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:20,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 147 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 203 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2024-11-19 06:47:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:47:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-19 06:47:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.7) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:47:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-19 06:47:20,291 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 12 [2024-11-19 06:47:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:20,292 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-19 06:47:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-19 06:47:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:20,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:20,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:20,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:47:20,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:20,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2040230946, now seen corresponding path program 1 times [2024-11-19 06:47:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299109457] [2024-11-19 06:47:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:20,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:20,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:20,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:47:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:20,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:47:20,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:20,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-19 06:47:20,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:20,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299109457] [2024-11-19 06:47:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299109457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776193593] [2024-11-19 06:47:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:20,585 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-19 06:47:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:20,613 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 06:47:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:20,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-19 06:47:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:20,615 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:47:20,616 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:47:20,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:20,617 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:20,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:47:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:47:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-19 06:47:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 69 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:47:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2024-11-19 06:47:20,631 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 11 [2024-11-19 06:47:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:20,631 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2024-11-19 06:47:20,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-19 06:47:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2024-11-19 06:47:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:20,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:20,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:20,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:20,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1367232669, now seen corresponding path program 1 times [2024-11-19 06:47:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029925993] [2024-11-19 06:47:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:20,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:20,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:47:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:20,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:47:20,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:20,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:20,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:20,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029925993] [2024-11-19 06:47:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029925993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:47:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158280832] [2024-11-19 06:47:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:20,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:20,953 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-19 06:47:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:21,239 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-19 06:47:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-19 06:47:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:21,240 INFO L225 Difference]: With dead ends: 104 [2024-11-19 06:47:21,240 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:47:21,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:21,242 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:21,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 86 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:47:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2024-11-19 06:47:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-19 06:47:21,250 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 11 [2024-11-19 06:47:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-19 06:47:21,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-19 06:47:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-19 06:47:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:47:21,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:21,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:21,257 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 (5)] Ended with exit code 0 [2024-11-19 06:47:21,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:21,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1367232668, now seen corresponding path program 1 times [2024-11-19 06:47:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145762744] [2024-11-19 06:47:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:21,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:21,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:21,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:47:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:21,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:47:21,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:21,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:21,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:21,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145762744] [2024-11-19 06:47:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145762744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:47:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235804127] [2024-11-19 06:47:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:21,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:47:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:47:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:21,612 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-19 06:47:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:21,878 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-19 06:47:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:47:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-19 06:47:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:21,880 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:47:21,881 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:47:21,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:47:21,882 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 103 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:47:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2024-11-19 06:47:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-19 06:47:21,893 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 11 [2024-11-19 06:47:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:21,893 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-19 06:47:21,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-19 06:47:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-19 06:47:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:47:21,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:21,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:21,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:22,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1104390458, now seen corresponding path program 1 times [2024-11-19 06:47:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247507970] [2024-11-19 06:47:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:22,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:47:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:22,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:47:22,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:26,200 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|)) is different from true [2024-11-19 06:47:26,260 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 15 treesize of output 7 [2024-11-19 06:47:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:26,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:26,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247507970] [2024-11-19 06:47:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247507970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:47:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602523052] [2024-11-19 06:47:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:47:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:47:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:47:26,301 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:26,621 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-19 06:47:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:47:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:47:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:26,622 INFO L225 Difference]: With dead ends: 81 [2024-11-19 06:47:26,622 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 06:47:26,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:47:26,623 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 20 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:26,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 313 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2024-11-19 06:47:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 06:47:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-19 06:47:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.6) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-19 06:47:26,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2024-11-19 06:47:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-19 06:47:26,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-19 06:47:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:47:26,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:26,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:26,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:47:26,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:26,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:26,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1104390459, now seen corresponding path program 1 times [2024-11-19 06:47:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819385377] [2024-11-19 06:47:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:26,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:26,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:26,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:47:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:26,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:47:26,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:47:26,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:27,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-19 06:47:27,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-19 06:47:27,084 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)))))) is different from true [2024-11-19 06:47:27,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:27,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:47:27,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:27,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:47:27,422 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:47:27,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2024-11-19 06:47:27,430 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:47:27,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-19 06:47:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:27,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:27,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819385377] [2024-11-19 06:47:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819385377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:47:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772104056] [2024-11-19 06:47:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:47:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:47:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:47:27,515 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:28,341 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 06:47:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:47:28,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:47:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:28,343 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:47:28,343 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:47:28,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:47:28,344 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 28 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:28,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 349 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 95 Unchecked, 0.6s Time] [2024-11-19 06:47:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:47:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-19 06:47:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 69 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:47:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-19 06:47:28,350 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 15 [2024-11-19 06:47:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-19 06:47:28,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:47:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-19 06:47:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:47:28,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:28,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:28,358 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-19 06:47:28,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:28,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 06:47:28,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 349398628, now seen corresponding path program 1 times [2024-11-19 06:47:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389751799] [2024-11-19 06:47:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:28,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:28,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:47:28,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:47:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:28,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:47:28,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:47:28,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-19 06:47:28,743 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 15 treesize of output 7 [2024-11-19 06:47:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:28,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:28,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389751799] [2024-11-19 06:47:28,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389751799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:28,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:28,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563599502] [2024-11-19 06:47:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:28,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:28,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:28,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:28,773 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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-19 06:47:32,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:36,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:40,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:44,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:48,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:52,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:47:57,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:01,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:05,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:09,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:13,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:17,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:21,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:25,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:29,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:33,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:37,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:41,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:45,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:48:49,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]