./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:02:25,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:02:25,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:02:25,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:02:25,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:02:25,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:02:25,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:02:25,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:02:25,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:02:25,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:02:25,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:02:25,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:02:25,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:02:25,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:02:25,297 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:02:25,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:02:25,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:02:25,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:02:25,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:02:25,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:02:25,298 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:02:25,301 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:02:25,301 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:02:25,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:02:25,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:02:25,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:02:25,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:02:25,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:02:25,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:02:25,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:02:25,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:25,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:02:25,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:02:25,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:02:25,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:02:25,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:02:25,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:02:25,304 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-clean/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-clean/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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-10-11 18:02:25,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:02:25,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:02:25,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:02:25,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:02:25,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:02:25,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-10-11 18:02:26,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:02:26,981 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:02:26,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-10-11 18:02:26,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01873cf92/b2d610eb77354c58b23a2aad4fdc0fd7/FLAGdc6380100 [2024-10-11 18:02:27,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01873cf92/b2d610eb77354c58b23a2aad4fdc0fd7 [2024-10-11 18:02:27,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:02:27,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:02:27,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:27,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:02:27,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:02:27,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:27" (1/1) ... [2024-10-11 18:02:27,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b24dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:27, skipping insertion in model container [2024-10-11 18:02:27,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:27" (1/1) ... [2024-10-11 18:02:27,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:02:27,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:27,733 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 18:02:27,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@17a6359d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:27, skipping insertion in model container [2024-10-11 18:02:27,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:27,735 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:02:27,737 INFO L158 Benchmark]: Toolchain (without parser) took 414.04ms. Allocated memory is still 182.5MB. Free memory was 151.5MB in the beginning and 137.7MB in the end (delta: 13.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-11 18:02:27,737 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:02:27,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.24ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 137.7MB in the end (delta: 13.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-11 18:02:27,739 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.13ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.24ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 137.7MB in the end (delta: 13.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:02:29,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:02:29,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:02:29,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:02:29,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:02:29,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:02:29,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:02:29,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:02:29,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:02:29,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:02:29,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:02:29,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:02:29,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:02:29,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:02:29,498 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:02:29,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:02:29,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:02:29,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:02:29,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:02:29,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:02:29,502 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:02:29,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:02:29,502 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:02:29,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:02:29,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:02:29,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:02:29,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:02:29,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:02:29,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:02:29,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:02:29,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:29,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:02:29,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:02:29,509 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:02:29,509 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:29,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:02:29,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:02:29,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:02:29,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:02:29,510 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:02:29,510 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-clean/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-clean/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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-10-11 18:02:29,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:02:29,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:02:29,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:02:29,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:02:29,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:02:29,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-10-11 18:02:31,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:02:31,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:02:31,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-10-11 18:02:31,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16c2525f3/601fd189da6b4a9e98570eba2ccefc8b/FLAGfd5de267a [2024-10-11 18:02:31,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16c2525f3/601fd189da6b4a9e98570eba2ccefc8b [2024-10-11 18:02:31,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:02:31,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:02:31,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:31,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:02:31,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:02:31,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a845830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31, skipping insertion in model container [2024-10-11 18:02:31,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:02:31,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:31,717 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:02:31,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:02:31,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:31,790 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:02:31,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:31,899 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:02:31,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31 WrapperNode [2024-10-11 18:02:31,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:31,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:31,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:02:31,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:02:31,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,966 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 349 [2024-10-11 18:02:31,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:31,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:02:31,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:02:31,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:02:31,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:31,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,035 INFO L175 MemorySlicer]: Split 55 memory accesses to 2 slices as follows [10, 45]. 82 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [8, 2]. The 23 writes are split as follows [0, 23]. [2024-10-11 18:02:32,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:02:32,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:02:32,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:02:32,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:02:32,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (1/1) ... [2024-10-11 18:02:32,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:32,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:02:32,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:02:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 18:02:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 18:02:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 18:02:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 18:02:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 18:02:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 18:02:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 18:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 18:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-11 18:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-11 18:02:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 18:02:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2024-10-11 18:02:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2024-10-11 18:02:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:02:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#0 [2024-10-11 18:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#1 [2024-10-11 18:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 18:02:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#0 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#1 [2024-10-11 18:02:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:02:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:02:32,329 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:02:32,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:02:32,456 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 18:02:32,579 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 18:02:33,226 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-10-11 18:02:33,227 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:02:33,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:02:33,320 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 18:02:33,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:33 BoogieIcfgContainer [2024-10-11 18:02:33,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:02:33,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:02:33,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:02:33,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:02:33,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:02:31" (1/3) ... [2024-10-11 18:02:33,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cee1da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:33, skipping insertion in model container [2024-10-11 18:02:33,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:31" (2/3) ... [2024-10-11 18:02:33,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cee1da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:33, skipping insertion in model container [2024-10-11 18:02:33,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:33" (3/3) ... [2024-10-11 18:02:33,327 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-2.i [2024-10-11 18:02:33,340 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:02:33,340 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2024-10-11 18:02:33,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:02:33,393 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;@6e791097, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:02:33,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2024-10-11 18:02:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 132 states have (on average 2.121212121212121) internal successors, (280), 255 states have internal predecessors, (280), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 18:02:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:02:33,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:33,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:33,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1604521214, now seen corresponding path program 1 times [2024-10-11 18:02:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221315035] [2024-10-11 18:02:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:33,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 18:02:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:33,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:33,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:33,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:33,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221315035] [2024-10-11 18:02:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221315035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:33,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752308545] [2024-10-11 18:02:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:02:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:02:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:33,707 INFO L87 Difference]: Start difference. First operand has 274 states, 132 states have (on average 2.121212121212121) internal successors, (280), 255 states have internal predecessors, (280), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:34,447 INFO L93 Difference]: Finished difference Result 361 states and 408 transitions. [2024-10-11 18:02:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:02:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 18:02:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:34,471 INFO L225 Difference]: With dead ends: 361 [2024-10-11 18:02:34,471 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 18:02:34,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:34,477 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 268 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:34,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 399 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:02:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 18:02:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 296. [2024-10-11 18:02:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 152 states have (on average 2.0921052631578947) internal successors, (318), 273 states have internal predecessors, (318), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-10-11 18:02:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2024-10-11 18:02:34,566 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 10 [2024-10-11 18:02:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:34,566 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2024-10-11 18:02:34,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2024-10-11 18:02:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:02:34,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:34,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:34,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:34,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:34,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:34,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1604521215, now seen corresponding path program 1 times [2024-10-11 18:02:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:34,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161849929] [2024-10-11 18:02:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:34,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:34,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:34,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 18:02:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:34,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:02:34,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:34,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:34,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161849929] [2024-10-11 18:02:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161849929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:34,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:34,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:34,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102736028] [2024-10-11 18:02:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:02:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:02:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:34,973 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:35,607 INFO L93 Difference]: Finished difference Result 414 states and 502 transitions. [2024-10-11 18:02:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:02:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 18:02:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:35,611 INFO L225 Difference]: With dead ends: 414 [2024-10-11 18:02:35,611 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 18:02:35,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:35,612 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 123 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:35,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 688 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:02:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 18:02:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 353. [2024-10-11 18:02:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 202 states have (on average 2.0544554455445545) internal successors, (415), 322 states have internal predecessors, (415), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-10-11 18:02:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 466 transitions. [2024-10-11 18:02:35,631 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 466 transitions. Word has length 10 [2024-10-11 18:02:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:35,631 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 466 transitions. [2024-10-11 18:02:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 466 transitions. [2024-10-11 18:02:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:02:35,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:35,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:35,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 18:02:35,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:35,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 717017534, now seen corresponding path program 1 times [2024-10-11 18:02:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580249139] [2024-10-11 18:02:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:35,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-10-11 18:02:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:35,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:35,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 18:02:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:35,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:02:35,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:35,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:35,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:35,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580249139] [2024-10-11 18:02:35,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580249139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:35,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:35,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:02:35,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356571519] [2024-10-11 18:02:35,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:35,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:35,928 INFO L87 Difference]: Start difference. First operand 353 states and 466 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:36,194 INFO L93 Difference]: Finished difference Result 531 states and 685 transitions. [2024-10-11 18:02:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-11 18:02:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:36,196 INFO L225 Difference]: With dead ends: 531 [2024-10-11 18:02:36,196 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 18:02:36,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-11 18:02:36,197 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 190 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:36,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1060 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 18:02:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 344. [2024-10-11 18:02:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 193 states have (on average 2.0259067357512954) internal successors, (391), 314 states have internal predecessors, (391), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-10-11 18:02:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 446 transitions. [2024-10-11 18:02:36,209 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 446 transitions. Word has length 10 [2024-10-11 18:02:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 446 transitions. [2024-10-11 18:02:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 446 transitions. [2024-10-11 18:02:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:02:36,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:36,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:36,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:36,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1799446052, now seen corresponding path program 1 times [2024-10-11 18:02:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76881371] [2024-10-11 18:02:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:36,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:36,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 18:02:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:36,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:36,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:36,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:36,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76881371] [2024-10-11 18:02:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76881371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726476908] [2024-10-11 18:02:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:36,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:36,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:36,591 INFO L87 Difference]: Start difference. First operand 344 states and 446 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:37,184 INFO L93 Difference]: Finished difference Result 382 states and 487 transitions. [2024-10-11 18:02:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:02:37,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:37,186 INFO L225 Difference]: With dead ends: 382 [2024-10-11 18:02:37,188 INFO L226 Difference]: Without dead ends: 382 [2024-10-11 18:02:37,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:02:37,189 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 48 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:37,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 762 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:02:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-11 18:02:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2024-10-11 18:02:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 201 states have (on average 2.0) internal successors, (402), 323 states have internal predecessors, (402), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-10-11 18:02:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 457 transitions. [2024-10-11 18:02:37,199 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 457 transitions. Word has length 11 [2024-10-11 18:02:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:37,199 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 457 transitions. [2024-10-11 18:02:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 457 transitions. [2024-10-11 18:02:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:02:37,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:37,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:37,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:37,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:37,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1799446051, now seen corresponding path program 1 times [2024-10-11 18:02:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675495821] [2024-10-11 18:02:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:37,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:37,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 18:02:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:37,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:37,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:37,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:37,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675495821] [2024-10-11 18:02:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675495821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:37,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903082959] [2024-10-11 18:02:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:37,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:37,627 INFO L87 Difference]: Start difference. First operand 355 states and 457 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:38,412 INFO L93 Difference]: Finished difference Result 372 states and 470 transitions. [2024-10-11 18:02:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:38,414 INFO L225 Difference]: With dead ends: 372 [2024-10-11 18:02:38,414 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 18:02:38,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:02:38,415 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 25 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:38,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 860 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:02:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 18:02:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 362. [2024-10-11 18:02:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 208 states have (on average 1.9855769230769231) internal successors, (413), 330 states have internal predecessors, (413), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-10-11 18:02:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 468 transitions. [2024-10-11 18:02:38,424 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 468 transitions. Word has length 11 [2024-10-11 18:02:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 468 transitions. [2024-10-11 18:02:38,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-10-11 18:02:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 468 transitions. [2024-10-11 18:02:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:02:38,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:38,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:38,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 18:02:38,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:38,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:38,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1806863907, now seen corresponding path program 1 times [2024-10-11 18:02:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619878413] [2024-10-11 18:02:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:38,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:38,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:38,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 18:02:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:38,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:02:38,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:38,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:38,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619878413] [2024-10-11 18:02:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619878413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993442189] [2024-10-11 18:02:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:02:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:02:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:38,728 INFO L87 Difference]: Start difference. First operand 362 states and 468 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:39,275 INFO L93 Difference]: Finished difference Result 399 states and 492 transitions. [2024-10-11 18:02:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:02:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-11 18:02:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:39,277 INFO L225 Difference]: With dead ends: 399 [2024-10-11 18:02:39,277 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 18:02:39,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:39,278 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 84 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:39,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 620 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:02:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 18:02:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 361. [2024-10-11 18:02:39,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 206 states have (on average 1.9902912621359223) internal successors, (410), 329 states have internal predecessors, (410), 21 states have call successors, (21), 11 states have call predecessors, (21), 14 states have return successors, (35), 22 states have call predecessors, (35), 21 states have call successors, (35) [2024-10-11 18:02:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 466 transitions. [2024-10-11 18:02:39,290 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 466 transitions. Word has length 14 [2024-10-11 18:02:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:39,291 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 466 transitions. [2024-10-11 18:02:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 466 transitions. [2024-10-11 18:02:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:39,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:39,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:39,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:39,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:39,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1548158840, now seen corresponding path program 1 times [2024-10-11 18:02:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598295160] [2024-10-11 18:02:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:39,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:39,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 18:02:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:39,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:39,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:39,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:39,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598295160] [2024-10-11 18:02:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598295160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:02:39,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843286734] [2024-10-11 18:02:39,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:39,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:39,594 INFO L87 Difference]: Start difference. First operand 361 states and 466 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:02:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:39,802 INFO L93 Difference]: Finished difference Result 301 states and 347 transitions. [2024-10-11 18:02:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-11 18:02:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:39,803 INFO L225 Difference]: With dead ends: 301 [2024-10-11 18:02:39,804 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 18:02:39,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-10-11 18:02:39,804 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:39,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 18:02:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2024-10-11 18:02:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 149 states have (on average 2.0201342281879193) internal successors, (301), 271 states have internal predecessors, (301), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-11 18:02:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 336 transitions. [2024-10-11 18:02:39,817 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 336 transitions. Word has length 16 [2024-10-11 18:02:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 336 transitions. [2024-10-11 18:02:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:02:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 336 transitions. [2024-10-11 18:02:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:39,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:39,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:39,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1254755833, now seen corresponding path program 1 times [2024-10-11 18:02:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157804934] [2024-10-11 18:02:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:40,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:40,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 18:02:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:40,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:40,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:02:40,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:40,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157804934] [2024-10-11 18:02:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157804934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:02:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212388353] [2024-10-11 18:02:40,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:40,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:40,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:40,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:40,107 INFO L87 Difference]: Start difference. First operand 295 states and 336 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:02:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:40,287 INFO L93 Difference]: Finished difference Result 299 states and 345 transitions. [2024-10-11 18:02:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-11 18:02:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:40,289 INFO L225 Difference]: With dead ends: 299 [2024-10-11 18:02:40,290 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 18:02:40,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-10-11 18:02:40,291 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:40,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1074 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 18:02:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2024-10-11 18:02:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 151 states have (on average 2.006622516556291) internal successors, (303), 272 states have internal predecessors, (303), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-11 18:02:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 338 transitions. [2024-10-11 18:02:40,300 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 338 transitions. Word has length 16 [2024-10-11 18:02:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 338 transitions. [2024-10-11 18:02:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:02:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 338 transitions. [2024-10-11 18:02:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:40,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:40,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:40,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 18:02:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1254755582, now seen corresponding path program 1 times [2024-10-11 18:02:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478640582] [2024-10-11 18:02:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:40,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:40,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:40,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 18:02:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:40,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:02:40,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:02:40,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:02:40,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478640582] [2024-10-11 18:02:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478640582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:40,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-10-11 18:02:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993347494] [2024-10-11 18:02:40,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:40,609 INFO L87 Difference]: Start difference. First operand 297 states and 338 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:02:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:40,781 INFO L93 Difference]: Finished difference Result 296 states and 337 transitions. [2024-10-11 18:02:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-11 18:02:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:40,783 INFO L225 Difference]: With dead ends: 296 [2024-10-11 18:02:40,783 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 18:02:40,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-10-11 18:02:40,784 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 187 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:40,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 868 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 18:02:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-10-11 18:02:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 151 states have (on average 2.0) internal successors, (302), 271 states have internal predecessors, (302), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-11 18:02:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 337 transitions. [2024-10-11 18:02:40,789 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 337 transitions. Word has length 16 [2024-10-11 18:02:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:40,789 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 337 transitions. [2024-10-11 18:02:40,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:02:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 337 transitions. [2024-10-11 18:02:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:40,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:40,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:40,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 18:02:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1283384984, now seen corresponding path program 1 times [2024-10-11 18:02:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351547913] [2024-10-11 18:02:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:40,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:40,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:40,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:40,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 18:02:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:41,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:02:41,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:41,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:02:41,186 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:02:41,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:02:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:41,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:49,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351547913] [2024-10-11 18:02:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351547913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:49,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-11 18:02:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932261584] [2024-10-11 18:02:49,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:49,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:02:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:02:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-10-11 18:02:49,478 INFO L87 Difference]: Start difference. First operand 296 states and 337 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:02:54,031 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-10-11 18:02:58,207 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-10-11 18:02:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:58,822 INFO L93 Difference]: Finished difference Result 328 states and 371 transitions. [2024-10-11 18:02:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:02:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-10-11 18:02:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:58,824 INFO L225 Difference]: With dead ends: 328 [2024-10-11 18:02:58,824 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 18:02:58,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2024-10-11 18:02:58,824 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 198 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:58,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 814 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 854 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-10-11 18:02:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 18:02:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 296. [2024-10-11 18:02:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 154 states have (on average 1.9675324675324675) internal successors, (303), 271 states have internal predecessors, (303), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-10-11 18:02:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2024-10-11 18:02:58,829 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 16 [2024-10-11 18:02:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2024-10-11 18:02:58,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:02:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2024-10-11 18:02:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:58,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:58,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:58,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 18:02:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:59,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:02:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1283384983, now seen corresponding path program 1 times [2024-10-11 18:02:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101588056] [2024-10-11 18:02:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:59,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:02:59,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 18:02:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:59,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:02:59,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:59,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:02:59,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:02:59,194 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-10-11 18:02:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:59,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:02:59,221 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:02:59,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 18:02:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:02:59,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:59,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101588056] [2024-10-11 18:02:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101588056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1956429996] [2024-10-11 18:02:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:59,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:02:59,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:02:59,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-10-11 18:02:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:59,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:02:59,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:59,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:02:59,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:02:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:59,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:02:59,596 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:02:59,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 18:02:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:02:59,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1956429996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:03,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 18:03:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616835132] [2024-10-11 18:03:03,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:03:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:03,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:03:03,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:03:03,736 INFO L87 Difference]: Start difference. First operand 296 states and 338 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:05,739 INFO L93 Difference]: Finished difference Result 569 states and 679 transitions. [2024-10-11 18:03:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:03:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-11 18:03:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:05,741 INFO L225 Difference]: With dead ends: 569 [2024-10-11 18:03:05,741 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 18:03:05,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:03:05,741 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 415 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:05,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1291 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1625 Invalid, 0 Unknown, 637 Unchecked, 1.9s Time] [2024-10-11 18:03:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 18:03:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 308. [2024-10-11 18:03:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 164 states have (on average 1.9329268292682926) internal successors, (317), 280 states have internal predecessors, (317), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 364 transitions. [2024-10-11 18:03:05,749 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 364 transitions. Word has length 16 [2024-10-11 18:03:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:05,750 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 364 transitions. [2024-10-11 18:03:05,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 364 transitions. [2024-10-11 18:03:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:03:05,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:05,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:05,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 18:03:05,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:03:06,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:06,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:06,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -242716933, now seen corresponding path program 1 times [2024-10-11 18:03:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435309953] [2024-10-11 18:03:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:06,153 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:06,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 18:03:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:06,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:03:06,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:03:06,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:06,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435309953] [2024-10-11 18:03:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435309953] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:03:06,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-11 18:03:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458941488] [2024-10-11 18:03:06,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:06,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:03:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:03:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:03:06,392 INFO L87 Difference]: Start difference. First operand 308 states and 364 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:03:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:06,958 INFO L93 Difference]: Finished difference Result 307 states and 362 transitions. [2024-10-11 18:03:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:03:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-10-11 18:03:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:06,960 INFO L225 Difference]: With dead ends: 307 [2024-10-11 18:03:06,960 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 18:03:06,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:03:06,961 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 453 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:06,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 978 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:03:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 18:03:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-11 18:03:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 164 states have (on average 1.920731707317073) internal successors, (315), 279 states have internal predecessors, (315), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 362 transitions. [2024-10-11 18:03:06,966 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 362 transitions. Word has length 17 [2024-10-11 18:03:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:06,966 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 362 transitions. [2024-10-11 18:03:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:03:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 362 transitions. [2024-10-11 18:03:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:03:06,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:06,967 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:06,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 18:03:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:07,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1945219399, now seen corresponding path program 1 times [2024-10-11 18:03:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229082360] [2024-10-11 18:03:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:07,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:07,170 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:07,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 18:03:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:07,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:03:07,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:07,287 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:07,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:07,389 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 16 treesize of output 13 [2024-10-11 18:03:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:07,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:07,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229082360] [2024-10-11 18:03:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229082360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1199493976] [2024-10-11 18:03:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:07,455 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:03:07,457 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:03:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-11 18:03:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:07,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:03:07,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:07,635 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:07,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:07,699 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 16 treesize of output 13 [2024-10-11 18:03:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:07,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1199493976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:07,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 18:03:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56205827] [2024-10-11 18:03:07,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:07,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:03:07,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:03:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:03:07,752 INFO L87 Difference]: Start difference. First operand 307 states and 362 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:08,925 INFO L93 Difference]: Finished difference Result 377 states and 430 transitions. [2024-10-11 18:03:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:03:08,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 18:03:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:08,927 INFO L225 Difference]: With dead ends: 377 [2024-10-11 18:03:08,927 INFO L226 Difference]: Without dead ends: 377 [2024-10-11 18:03:08,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:03:08,928 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 361 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:08,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 672 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 18:03:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-11 18:03:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 309. [2024-10-11 18:03:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 166 states have (on average 1.9156626506024097) internal successors, (318), 281 states have internal predecessors, (318), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 365 transitions. [2024-10-11 18:03:08,938 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 365 transitions. Word has length 20 [2024-10-11 18:03:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:08,938 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 365 transitions. [2024-10-11 18:03:08,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 365 transitions. [2024-10-11 18:03:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:03:08,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:08,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:08,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 18:03:09,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-10-11 18:03:09,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:09,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:09,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1945219400, now seen corresponding path program 1 times [2024-10-11 18:03:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:09,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365624369] [2024-10-11 18:03:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:09,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:09,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:09,343 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:09,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 18:03:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:09,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:03:09,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:03:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:03:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:03:09,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:13,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365624369] [2024-10-11 18:03:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365624369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1731368507] [2024-10-11 18:03:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:03:13,817 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:03:13,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-11 18:03:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:13,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:03:13,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:13,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:03:13,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:03:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:03:14,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1731368507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:18,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 18:03:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879223056] [2024-10-11 18:03:18,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:18,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:03:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:18,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:03:18,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-10-11 18:03:18,248 INFO L87 Difference]: Start difference. First operand 309 states and 365 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:22,580 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-10-11 18:03:27,347 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-10-11 18:03:31,364 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-10-11 18:03:36,551 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-10-11 18:03:40,618 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-10-11 18:03:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:40,630 INFO L93 Difference]: Finished difference Result 372 states and 425 transitions. [2024-10-11 18:03:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:03:40,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 18:03:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:40,632 INFO L225 Difference]: With dead ends: 372 [2024-10-11 18:03:40,632 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 18:03:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=85, Invalid=154, Unknown=1, NotChecked=0, Total=240 [2024-10-11 18:03:40,633 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 416 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:40,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 448 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 791 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2024-10-11 18:03:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 18:03:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 308. [2024-10-11 18:03:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 166 states have (on average 1.9036144578313252) internal successors, (316), 280 states have internal predecessors, (316), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 363 transitions. [2024-10-11 18:03:40,641 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 363 transitions. Word has length 20 [2024-10-11 18:03:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 363 transitions. [2024-10-11 18:03:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:03:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 363 transitions. [2024-10-11 18:03:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:03:40,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:40,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:40,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-10-11 18:03:40,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 18:03:41,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:41,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 172263091, now seen corresponding path program 1 times [2024-10-11 18:03:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051321520] [2024-10-11 18:03:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:41,046 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:41,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 18:03:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:41,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:03:41,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:41,163 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-10-11 18:03:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:03:41,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:03:41,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051321520] [2024-10-11 18:03:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051321520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:03:41,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:03:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:03:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113055301] [2024-10-11 18:03:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:03:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:03:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:03:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:03:41,171 INFO L87 Difference]: Start difference. First operand 308 states and 363 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:41,743 INFO L93 Difference]: Finished difference Result 337 states and 395 transitions. [2024-10-11 18:03:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:03:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 18:03:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:41,746 INFO L225 Difference]: With dead ends: 337 [2024-10-11 18:03:41,746 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 18:03:41,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:41,746 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 40 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:41,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 670 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:03:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 18:03:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 309. [2024-10-11 18:03:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 167 states have (on average 1.904191616766467) internal successors, (318), 281 states have internal predecessors, (318), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 365 transitions. [2024-10-11 18:03:41,756 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 365 transitions. Word has length 21 [2024-10-11 18:03:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 365 transitions. [2024-10-11 18:03:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 365 transitions. [2024-10-11 18:03:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:03:41,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:41,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:41,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 18:03:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:41,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash 172263092, now seen corresponding path program 1 times [2024-10-11 18:03:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199781766] [2024-10-11 18:03:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:41,964 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:41,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 18:03:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:42,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:03:42,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:42,193 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-10-11 18:03:42,197 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 7 treesize of output 3 [2024-10-11 18:03:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:03:42,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:03:42,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199781766] [2024-10-11 18:03:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199781766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:03:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:03:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:03:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509316110] [2024-10-11 18:03:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:03:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:03:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:03:42,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:03:42,207 INFO L87 Difference]: Start difference. First operand 309 states and 365 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:42,818 INFO L93 Difference]: Finished difference Result 327 states and 384 transitions. [2024-10-11 18:03:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:03:42,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 18:03:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:42,822 INFO L225 Difference]: With dead ends: 327 [2024-10-11 18:03:42,822 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 18:03:42,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:42,823 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 29 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:42,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:03:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 18:03:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 309. [2024-10-11 18:03:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 167 states have (on average 1.8982035928143712) internal successors, (317), 281 states have internal predecessors, (317), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 364 transitions. [2024-10-11 18:03:42,830 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 364 transitions. Word has length 21 [2024-10-11 18:03:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:42,830 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 364 transitions. [2024-10-11 18:03:42,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 364 transitions. [2024-10-11 18:03:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:03:42,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:42,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:42,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:03:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:43,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1958776383, now seen corresponding path program 1 times [2024-10-11 18:03:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235917417] [2024-10-11 18:03:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:43,038 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:43,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 18:03:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:43,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:03:43,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:03:43,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:03:43,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235917417] [2024-10-11 18:03:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235917417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:03:43,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:03:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:03:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175219975] [2024-10-11 18:03:43,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:03:43,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:03:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:03:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:03:43,340 INFO L87 Difference]: Start difference. First operand 309 states and 364 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:43,811 INFO L93 Difference]: Finished difference Result 313 states and 367 transitions. [2024-10-11 18:03:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:03:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 18:03:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:43,813 INFO L225 Difference]: With dead ends: 313 [2024-10-11 18:03:43,814 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 18:03:43,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:43,814 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 6 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:43,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 752 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:03:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 18:03:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-10-11 18:03:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 168 states have (on average 1.8928571428571428) internal successors, (318), 282 states have internal predecessors, (318), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 365 transitions. [2024-10-11 18:03:43,822 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 365 transitions. Word has length 23 [2024-10-11 18:03:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:43,822 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 365 transitions. [2024-10-11 18:03:43,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 365 transitions. [2024-10-11 18:03:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:43,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:43,823 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:43,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:03:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:44,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 661083009, now seen corresponding path program 1 times [2024-10-11 18:03:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439819201] [2024-10-11 18:03:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:44,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:44,026 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:44,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 18:03:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:44,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:03:44,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:44,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:44,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439819201] [2024-10-11 18:03:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439819201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:03:44,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-10-11 18:03:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589449083] [2024-10-11 18:03:44,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:44,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:03:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:03:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:44,148 INFO L87 Difference]: Start difference. First operand 310 states and 365 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:03:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:44,370 INFO L93 Difference]: Finished difference Result 309 states and 364 transitions. [2024-10-11 18:03:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:03:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-11 18:03:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:44,372 INFO L225 Difference]: With dead ends: 309 [2024-10-11 18:03:44,372 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 18:03:44,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-10-11 18:03:44,372 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 175 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:44,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 862 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:03:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 18:03:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-11 18:03:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 168 states have (on average 1.8869047619047619) internal successors, (317), 281 states have internal predecessors, (317), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-11 18:03:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 364 transitions. [2024-10-11 18:03:44,379 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 364 transitions. Word has length 24 [2024-10-11 18:03:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 364 transitions. [2024-10-11 18:03:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:03:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 364 transitions. [2024-10-11 18:03:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:44,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:44,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:44,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 18:03:44,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:44,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 661082775, now seen corresponding path program 1 times [2024-10-11 18:03:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043353783] [2024-10-11 18:03:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:44,583 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 18:03:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:44,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:03:44,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:44,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:03:44,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043353783] [2024-10-11 18:03:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043353783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:03:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:03:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:03:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439764694] [2024-10-11 18:03:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:03:44,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:03:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:03:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:44,692 INFO L87 Difference]: Start difference. First operand 309 states and 364 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:03:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:44,920 INFO L93 Difference]: Finished difference Result 307 states and 357 transitions. [2024-10-11 18:03:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:03:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 18:03:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:44,922 INFO L225 Difference]: With dead ends: 307 [2024-10-11 18:03:44,922 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 18:03:44,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-10-11 18:03:44,923 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:44,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1045 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:03:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 18:03:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-11 18:03:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 167 states have (on average 1.874251497005988) internal successors, (313), 279 states have internal predecessors, (313), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-10-11 18:03:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 357 transitions. [2024-10-11 18:03:44,929 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 357 transitions. Word has length 24 [2024-10-11 18:03:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:44,929 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 357 transitions. [2024-10-11 18:03:44,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:03:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 357 transitions. [2024-10-11 18:03:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:44,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:44,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:44,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-11 18:03:45,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:45,131 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:45,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:45,131 INFO L85 PathProgramCache]: Analyzing trace with hash 632453624, now seen corresponding path program 1 times [2024-10-11 18:03:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328367435] [2024-10-11 18:03:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:45,136 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:45,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 18:03:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:45,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:03:45,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:45,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:03:45,264 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-10-11 18:03:45,278 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:03:45,279 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-10-11 18:03:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-10-11 18:03:45,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:45,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328367435] [2024-10-11 18:03:45,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328367435] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:03:45,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:45,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-11 18:03:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330340699] [2024-10-11 18:03:45,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:03:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:03:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-11 18:03:45,448 INFO L87 Difference]: Start difference. First operand 307 states and 357 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:03:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:46,564 INFO L93 Difference]: Finished difference Result 333 states and 380 transitions. [2024-10-11 18:03:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:03:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-11 18:03:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:46,566 INFO L225 Difference]: With dead ends: 333 [2024-10-11 18:03:46,566 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 18:03:46,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-10-11 18:03:46,566 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 159 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:46,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 804 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 807 Invalid, 0 Unknown, 342 Unchecked, 1.1s Time] [2024-10-11 18:03:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 18:03:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 309. [2024-10-11 18:03:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 170 states have (on average 1.8588235294117648) internal successors, (316), 281 states have internal predecessors, (316), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-10-11 18:03:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 360 transitions. [2024-10-11 18:03:46,581 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 360 transitions. Word has length 24 [2024-10-11 18:03:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:46,581 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 360 transitions. [2024-10-11 18:03:46,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:03:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 360 transitions. [2024-10-11 18:03:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:46,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:46,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:46,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-11 18:03:46,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:46,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 632453625, now seen corresponding path program 1 times [2024-10-11 18:03:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:46,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320361273] [2024-10-11 18:03:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:46,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:46,786 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 18:03:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:46,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:03:46,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:46,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:03:46,969 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-10-11 18:03:46,988 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:03:46,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:03:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 18:03:47,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:47,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320361273] [2024-10-11 18:03:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320361273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1693529456] [2024-10-11 18:03:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:03:47,177 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:03:47,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-10-11 18:03:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:47,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:03:47,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:47,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:03:47,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:03:47,470 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-10-11 18:03:47,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:03:47,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:03:47,501 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:03:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 18:03:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-11 18:03:47,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1693529456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:47,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-11 18:03:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431860064] [2024-10-11 18:03:47,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:47,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:03:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:03:47,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-10-11 18:03:47,671 INFO L87 Difference]: Start difference. First operand 309 states and 360 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:03:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:50,477 INFO L93 Difference]: Finished difference Result 552 states and 658 transitions. [2024-10-11 18:03:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:03:50,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2024-10-11 18:03:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:50,481 INFO L225 Difference]: With dead ends: 552 [2024-10-11 18:03:50,481 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 18:03:50,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=225, Unknown=2, NotChecked=62, Total=342 [2024-10-11 18:03:50,482 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 393 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1210 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:50,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1589 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1694 Invalid, 0 Unknown, 1210 Unchecked, 2.7s Time] [2024-10-11 18:03:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 18:03:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 308. [2024-10-11 18:03:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 170 states have (on average 1.8529411764705883) internal successors, (315), 280 states have internal predecessors, (315), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-10-11 18:03:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2024-10-11 18:03:50,491 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 24 [2024-10-11 18:03:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2024-10-11 18:03:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:03:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2024-10-11 18:03:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:50,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:50,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:50,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-10-11 18:03:50,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-11 18:03:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:50,893 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -592524890, now seen corresponding path program 1 times [2024-10-11 18:03:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703187113] [2024-10-11 18:03:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:50,895 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:50,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 18:03:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:50,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:03:50,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:51,068 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~client~0#1.base_35| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_35|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_35| (_ bv0 1))))) is different from true [2024-10-11 18:03:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:51,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:51,170 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-11 18:03:51,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-11 18:03:51,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703187113] [2024-10-11 18:03:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703187113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39695505] [2024-10-11 18:03:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:03:51,313 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:03:51,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-10-11 18:03:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:51,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:03:51,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:51,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:51,675 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-11 18:03:51,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-11 18:03:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [39695505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:51,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-10-11 18:03:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460545457] [2024-10-11 18:03:51,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:03:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:03:51,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:03:51,762 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:03:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:53,134 INFO L93 Difference]: Finished difference Result 317 states and 367 transitions. [2024-10-11 18:03:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:03:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2024-10-11 18:03:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:53,136 INFO L225 Difference]: With dead ends: 317 [2024-10-11 18:03:53,136 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 18:03:53,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:03:53,137 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 37 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:53,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1105 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 959 Invalid, 0 Unknown, 311 Unchecked, 1.3s Time] [2024-10-11 18:03:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 18:03:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-10-11 18:03:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 165 states have (on average 1.8727272727272728) internal successors, (309), 276 states have internal predecessors, (309), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 18:03:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 352 transitions. [2024-10-11 18:03:53,142 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 352 transitions. Word has length 24 [2024-10-11 18:03:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 352 transitions. [2024-10-11 18:03:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:03:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 352 transitions. [2024-10-11 18:03:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:03:53,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:53,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:53,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-10-11 18:03:53,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-10-11 18:03:53,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:53,548 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:53,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -981262763, now seen corresponding path program 1 times [2024-10-11 18:03:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661543849] [2024-10-11 18:03:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:53,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:53,550 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:53,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-11 18:03:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:53,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:03:53,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:03:53,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:54,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661543849] [2024-10-11 18:03:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661543849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:03:54,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-11 18:03:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672520610] [2024-10-11 18:03:54,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:54,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:03:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:54,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:03:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:03:54,047 INFO L87 Difference]: Start difference. First operand 302 states and 352 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:03:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:55,237 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2024-10-11 18:03:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:03:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2024-10-11 18:03:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:55,239 INFO L225 Difference]: With dead ends: 303 [2024-10-11 18:03:55,239 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 18:03:55,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:03:55,240 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 610 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:55,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 918 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 18:03:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 18:03:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-10-11 18:03:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 165 states have (on average 1.8606060606060606) internal successors, (307), 275 states have internal predecessors, (307), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 18:03:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2024-10-11 18:03:55,250 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 25 [2024-10-11 18:03:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:55,250 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2024-10-11 18:03:55,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:03:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2024-10-11 18:03:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:03:55,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:55,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:55,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-10-11 18:03:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:55,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -86966265, now seen corresponding path program 1 times [2024-10-11 18:03:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079937546] [2024-10-11 18:03:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:55,454 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:55,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-11 18:03:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:55,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:03:55,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:55,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:03:55,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079937546] [2024-10-11 18:03:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079937546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:03:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:03:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:03:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513730052] [2024-10-11 18:03:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:03:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:03:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:03:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:03:55,547 INFO L87 Difference]: Start difference. First operand 301 states and 350 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:55,745 INFO L93 Difference]: Finished difference Result 294 states and 342 transitions. [2024-10-11 18:03:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:03:55,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 18:03:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:55,747 INFO L225 Difference]: With dead ends: 294 [2024-10-11 18:03:55,747 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 18:03:55,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-10-11 18:03:55,748 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 180 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:55,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 865 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:03:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 18:03:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-10-11 18:03:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 158 states have (on average 1.8924050632911393) internal successors, (299), 268 states have internal predecessors, (299), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 18:03:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 342 transitions. [2024-10-11 18:03:55,753 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 342 transitions. Word has length 24 [2024-10-11 18:03:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:55,754 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 342 transitions. [2024-10-11 18:03:55,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:03:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 342 transitions. [2024-10-11 18:03:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:03:55,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:55,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:55,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-10-11 18:03:55,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:55,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -129980998, now seen corresponding path program 1 times [2024-10-11 18:03:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:55,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693100664] [2024-10-11 18:03:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:55,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:55,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:55,957 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:55,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-10-11 18:03:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:56,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:03:56,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:56,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:03:56,111 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:56,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:56,184 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 16 treesize of output 13 [2024-10-11 18:03:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:56,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:03:56,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693100664] [2024-10-11 18:03:56,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693100664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:03:56,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:56,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-10-11 18:03:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544494314] [2024-10-11 18:03:56,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:03:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:03:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:03:56,511 INFO L87 Difference]: Start difference. First operand 294 states and 342 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:03:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:03:58,269 INFO L93 Difference]: Finished difference Result 321 states and 365 transitions. [2024-10-11 18:03:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:03:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2024-10-11 18:03:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:03:58,270 INFO L225 Difference]: With dead ends: 321 [2024-10-11 18:03:58,270 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 18:03:58,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:03:58,271 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 494 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:03:58,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 916 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:03:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 18:03:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2024-10-11 18:03:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 161 states have (on average 1.875776397515528) internal successors, (302), 271 states have internal predecessors, (302), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 18:03:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 345 transitions. [2024-10-11 18:03:58,283 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 345 transitions. Word has length 29 [2024-10-11 18:03:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:03:58,284 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 345 transitions. [2024-10-11 18:03:58,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:03:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 345 transitions. [2024-10-11 18:03:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:03:58,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:03:58,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:03:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-10-11 18:03:58,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:58,485 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-10-11 18:03:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:03:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash -357673123, now seen corresponding path program 1 times [2024-10-11 18:03:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:03:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815019499] [2024-10-11 18:03:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:03:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:03:58,487 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:03:58,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-10-11 18:03:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:58,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:03:58,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:58,647 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:58,730 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:58,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:58,847 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 16 treesize of output 13 [2024-10-11 18:03:58,871 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 16 treesize of output 13 [2024-10-11 18:03:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:58,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:58,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:03:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815019499] [2024-10-11 18:03:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815019499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [599085185] [2024-10-11 18:03:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:03:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:03:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:03:58,967 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:03:58,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-10-11 18:03:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:03:59,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:03:59,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:03:59,171 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:59,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:59,266 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:03:59,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:03:59,504 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 18 [2024-10-11 18:03:59,623 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2024-10-11 18:03:59,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 18:03:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:03:59,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:03:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [599085185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:03:59,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:03:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2024-10-11 18:03:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912592512] [2024-10-11 18:03:59,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:03:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:03:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:03:59,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:03:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:03:59,847 INFO L87 Difference]: Start difference. First operand 297 states and 345 transitions. Second operand has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:04:03,877 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]