./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:46:13,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:46:13,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:46:13,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:46:13,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:46:13,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:46:13,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:46:13,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:46:13,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:46:13,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:46:13,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:46:13,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:46:13,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:46:13,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:46:13,496 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:46:13,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:46:13,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:46:13,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:46:13,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:46:13,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:46:13,497 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:46:13,498 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:46:13,498 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:46:13,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:46:13,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:46:13,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:46:13,499 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:46:13,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:46:13,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:46:13,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:46:13,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:46:13,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:46:13,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:46:13,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:46:13,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:46:13,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:46:13,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:46:13,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:46:13,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:46:13,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:46:13,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:46:13,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:46:13,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-10-13 11:46:13,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:46:13,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:46:13,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:46:13,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:46:13,831 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:46:13,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-13 11:46:15,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:46:15,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:46:15,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-13 11:46:15,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6432316c/de209b0569844232ae839ce385cfb516/FLAG1f50c8af1 [2024-10-13 11:46:15,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6432316c/de209b0569844232ae839ce385cfb516 [2024-10-13 11:46:15,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:46:15,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:46:15,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:46:15,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:46:15,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:46:15,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:46:15" (1/1) ... [2024-10-13 11:46:15,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1d490d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:15, skipping insertion in model container [2024-10-13 11:46:15,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:46:15" (1/1) ... [2024-10-13 11:46:15,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:46:16,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:46:16,434 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:46:16,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@75d2873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:16, skipping insertion in model container [2024-10-13 11:46:16,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:46:16,435 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:46:16,436 INFO L158 Benchmark]: Toolchain (without parser) took 647.47ms. Allocated memory is still 178.3MB. Free memory was 143.7MB in the beginning and 119.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 11:46:16,437 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:46:16,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.59ms. Allocated memory is still 178.3MB. Free memory was 143.7MB in the beginning and 119.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 11:46:16,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.59ms. Allocated memory is still 178.3MB. Free memory was 143.7MB in the beginning and 119.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:46:18,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:46:18,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:46:18,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:46:18,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:46:18,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:46:18,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:46:18,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:46:18,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:46:18,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:46:18,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:46:18,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:46:18,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:46:18,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:46:18,504 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:46:18,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:46:18,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:46:18,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:46:18,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:46:18,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:46:18,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:46:18,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:46:18,507 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:46:18,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:46:18,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:46:18,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:46:18,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:46:18,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:46:18,508 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:46:18,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:46:18,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:46:18,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:46:18,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:46:18,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:46:18,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:46:18,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:46:18,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:46:18,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:46:18,511 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:46:18,512 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:46:18,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:46:18,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:46:18,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:46:18,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:46:18,513 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:46:18,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-10-13 11:46:18,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:46:18,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:46:18,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:46:18,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:46:18,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:46:18,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-13 11:46:20,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:46:20,734 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:46:20,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-13 11:46:20,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857152b24/d31459b7ca374f8a9714717c7ebb1f66/FLAG6af6d2fca [2024-10-13 11:46:20,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857152b24/d31459b7ca374f8a9714717c7ebb1f66 [2024-10-13 11:46:20,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:46:20,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:46:20,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:46:20,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:46:20,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:46:20,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:46:20" (1/1) ... [2024-10-13 11:46:20,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102c99c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:20, skipping insertion in model container [2024-10-13 11:46:20,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:46:20" (1/1) ... [2024-10-13 11:46:20,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:46:21,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:46:21,453 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:46:21,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:46:21,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:46:21,584 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:46:21,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:46:21,727 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:46:21,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21 WrapperNode [2024-10-13 11:46:21,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:46:21,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:46:21,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:46:21,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:46:21,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,823 INFO L138 Inliner]: procedures = 285, calls = 343, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1234 [2024-10-13 11:46:21,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:46:21,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:46:21,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:46:21,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:46:21,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,930 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 3, 270, 34]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 57, 4]. [2024-10-13 11:46:21,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:21,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:22,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:22,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:22,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:46:22,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:46:22,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:46:22,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:46:22,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (1/1) ... [2024-10-13 11:46:22,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:46:22,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:46:22,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:46:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:46:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 11:46:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 11:46:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:46:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:46:22,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:46:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 11:46:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:46:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:46:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-13 11:46:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:46:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-13 11:46:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-13 11:46:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-13 11:46:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:46:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:46:22,372 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:46:22,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:46:25,557 INFO L? ?]: Removed 1307 outVars from TransFormulas that were not future-live. [2024-10-13 11:46:25,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:46:25,690 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:46:25,691 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-13 11:46:25,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:46:25 BoogieIcfgContainer [2024-10-13 11:46:25,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:46:25,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:46:25,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:46:25,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:46:25,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:46:20" (1/3) ... [2024-10-13 11:46:25,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fddb255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:46:25, skipping insertion in model container [2024-10-13 11:46:25,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:46:21" (2/3) ... [2024-10-13 11:46:25,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fddb255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:46:25, skipping insertion in model container [2024-10-13 11:46:25,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:46:25" (3/3) ... [2024-10-13 11:46:25,697 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2024-10-13 11:46:25,711 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:46:25,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-10-13 11:46:25,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:46:25,767 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;@4ac70c18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:46:25,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-10-13 11:46:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 1158 states, 508 states have (on average 2.515748031496063) internal successors, (1278), 1136 states have internal predecessors, (1278), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 11:46:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:46:25,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:25,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:46:25,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:25,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash 64323, now seen corresponding path program 1 times [2024-10-13 11:46:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612025080] [2024-10-13 11:46:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:25,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:25,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:46:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:25,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:46:25,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:26,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:46:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:26,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:26,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612025080] [2024-10-13 11:46:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612025080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:46:26,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040881766] [2024-10-13 11:46:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:26,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:26,057 INFO L87 Difference]: Start difference. First operand has 1158 states, 508 states have (on average 2.515748031496063) internal successors, (1278), 1136 states have internal predecessors, (1278), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:27,949 INFO L93 Difference]: Finished difference Result 1394 states and 1487 transitions. [2024-10-13 11:46:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:27,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:46:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:27,987 INFO L225 Difference]: With dead ends: 1394 [2024-10-13 11:46:27,987 INFO L226 Difference]: Without dead ends: 1393 [2024-10-13 11:46:27,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:27,993 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 827 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:27,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1036 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:46:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-13 11:46:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1171. [2024-10-13 11:46:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 536 states have (on average 2.3488805970149254) internal successors, (1259), 1151 states have internal predecessors, (1259), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 11:46:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1293 transitions. [2024-10-13 11:46:28,073 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1293 transitions. Word has length 2 [2024-10-13 11:46:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:28,074 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1293 transitions. [2024-10-13 11:46:28,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1293 transitions. [2024-10-13 11:46:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:46:28,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:28,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:46:28,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:46:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:28,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:28,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash 64324, now seen corresponding path program 1 times [2024-10-13 11:46:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544723768] [2024-10-13 11:46:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:28,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:28,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:46:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:28,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:46:28,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:46:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:28,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:28,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544723768] [2024-10-13 11:46:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544723768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:28,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:46:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797570598] [2024-10-13 11:46:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:28,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:28,473 INFO L87 Difference]: Start difference. First operand 1171 states and 1293 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:31,009 INFO L93 Difference]: Finished difference Result 1717 states and 1889 transitions. [2024-10-13 11:46:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:46:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:31,015 INFO L225 Difference]: With dead ends: 1717 [2024-10-13 11:46:31,015 INFO L226 Difference]: Without dead ends: 1717 [2024-10-13 11:46:31,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:31,016 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 579 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:31,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1444 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:46:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-10-13 11:46:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1345. [2024-10-13 11:46:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 709 states have (on average 2.3201692524682653) internal successors, (1645), 1323 states have internal predecessors, (1645), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 11:46:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1683 transitions. [2024-10-13 11:46:31,061 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1683 transitions. Word has length 2 [2024-10-13 11:46:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:31,061 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1683 transitions. [2024-10-13 11:46:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1683 transitions. [2024-10-13 11:46:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:46:31,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:31,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:46:31,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:46:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:31,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:31,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -722836583, now seen corresponding path program 1 times [2024-10-13 11:46:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689238285] [2024-10-13 11:46:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:31,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:31,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:31,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:46:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:31,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:46:31,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:46:31,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:46:31,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:46:31,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:46:31,509 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:46:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:46:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:31,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:31,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689238285] [2024-10-13 11:46:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689238285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:46:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939357867] [2024-10-13 11:46:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:31,535 INFO L87 Difference]: Start difference. First operand 1345 states and 1683 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:34,605 INFO L93 Difference]: Finished difference Result 2325 states and 2744 transitions. [2024-10-13 11:46:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:46:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:34,626 INFO L225 Difference]: With dead ends: 2325 [2024-10-13 11:46:34,626 INFO L226 Difference]: Without dead ends: 2325 [2024-10-13 11:46:34,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:34,627 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 1849 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:34,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 1175 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 11:46:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2024-10-13 11:46:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1461. [2024-10-13 11:46:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 825 states have (on average 2.3018181818181818) internal successors, (1899), 1439 states have internal predecessors, (1899), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 11:46:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1937 transitions. [2024-10-13 11:46:34,660 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1937 transitions. Word has length 6 [2024-10-13 11:46:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:34,660 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1937 transitions. [2024-10-13 11:46:34,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1937 transitions. [2024-10-13 11:46:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:46:34,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:34,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:34,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:46:34,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:34,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash -933097570, now seen corresponding path program 1 times [2024-10-13 11:46:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091664597] [2024-10-13 11:46:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:34,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:34,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:34,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:46:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:35,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:46:35,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:35,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:46:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:35,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:35,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091664597] [2024-10-13 11:46:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091664597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:35,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:35,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:46:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130116289] [2024-10-13 11:46:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:35,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:35,044 INFO L87 Difference]: Start difference. First operand 1461 states and 1937 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:36,664 INFO L93 Difference]: Finished difference Result 1935 states and 2639 transitions. [2024-10-13 11:46:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:46:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:36,670 INFO L225 Difference]: With dead ends: 1935 [2024-10-13 11:46:36,671 INFO L226 Difference]: Without dead ends: 1935 [2024-10-13 11:46:36,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:36,671 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 830 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:36,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1328 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:46:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2024-10-13 11:46:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1416. [2024-10-13 11:46:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 825 states have (on average 2.2303030303030305) internal successors, (1840), 1394 states have internal predecessors, (1840), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 11:46:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1878 transitions. [2024-10-13 11:46:36,691 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1878 transitions. Word has length 7 [2024-10-13 11:46:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:36,692 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1878 transitions. [2024-10-13 11:46:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1878 transitions. [2024-10-13 11:46:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:46:36,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:36,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:36,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 11:46:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:36,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:36,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -933097569, now seen corresponding path program 1 times [2024-10-13 11:46:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247849683] [2024-10-13 11:46:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:36,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:36,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:36,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:46:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:37,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:46:37,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:37,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:46:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:37,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:37,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247849683] [2024-10-13 11:46:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247849683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:46:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112754665] [2024-10-13 11:46:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:37,033 INFO L87 Difference]: Start difference. First operand 1416 states and 1878 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:39,452 INFO L93 Difference]: Finished difference Result 1990 states and 2652 transitions. [2024-10-13 11:46:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:46:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:39,459 INFO L225 Difference]: With dead ends: 1990 [2024-10-13 11:46:39,459 INFO L226 Difference]: Without dead ends: 1990 [2024-10-13 11:46:39,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:39,460 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 633 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:39,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1598 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:46:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2024-10-13 11:46:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1408. [2024-10-13 11:46:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 827 states have (on average 2.1983071342200726) internal successors, (1818), 1386 states have internal predecessors, (1818), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 11:46:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1856 transitions. [2024-10-13 11:46:39,503 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1856 transitions. Word has length 7 [2024-10-13 11:46:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1856 transitions. [2024-10-13 11:46:39,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1856 transitions. [2024-10-13 11:46:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:46:39,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:39,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:39,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:46:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:39,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1834606047, now seen corresponding path program 1 times [2024-10-13 11:46:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440729881] [2024-10-13 11:46:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:39,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:39,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:46:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:39,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:46:39,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:39,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:39,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440729881] [2024-10-13 11:46:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440729881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:39,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:39,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:46:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433784961] [2024-10-13 11:46:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:39,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:39,911 INFO L87 Difference]: Start difference. First operand 1408 states and 1856 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:41,336 INFO L93 Difference]: Finished difference Result 1969 states and 2562 transitions. [2024-10-13 11:46:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:46:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:41,342 INFO L225 Difference]: With dead ends: 1969 [2024-10-13 11:46:41,342 INFO L226 Difference]: Without dead ends: 1969 [2024-10-13 11:46:41,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:41,343 INFO L432 NwaCegarLoop]: 1152 mSDtfsCounter, 574 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:41,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 3120 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:46:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-10-13 11:46:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1625. [2024-10-13 11:46:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1041 states have (on average 2.1988472622478388) internal successors, (2289), 1600 states have internal predecessors, (2289), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 11:46:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2333 transitions. [2024-10-13 11:46:41,364 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2333 transitions. Word has length 12 [2024-10-13 11:46:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:41,364 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2333 transitions. [2024-10-13 11:46:41,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2333 transitions. [2024-10-13 11:46:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:46:41,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:41,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:41,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 11:46:41,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:41,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1237762582, now seen corresponding path program 1 times [2024-10-13 11:46:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157473096] [2024-10-13 11:46:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:41,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:41,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:41,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:41,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:46:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:41,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:46:41,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:41,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:41,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157473096] [2024-10-13 11:46:41,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157473096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:41,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:41,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:46:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185278646] [2024-10-13 11:46:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:41,718 INFO L87 Difference]: Start difference. First operand 1625 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:42,338 INFO L93 Difference]: Finished difference Result 1541 states and 2173 transitions. [2024-10-13 11:46:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:46:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:42,344 INFO L225 Difference]: With dead ends: 1541 [2024-10-13 11:46:42,344 INFO L226 Difference]: Without dead ends: 1541 [2024-10-13 11:46:42,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:42,344 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 61 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:42,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1934 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:46:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-10-13 11:46:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541. [2024-10-13 11:46:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 981 states have (on average 2.1702344546381243) internal successors, (2129), 1516 states have internal predecessors, (2129), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 11:46:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2173 transitions. [2024-10-13 11:46:42,369 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2173 transitions. Word has length 12 [2024-10-13 11:46:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:42,369 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2173 transitions. [2024-10-13 11:46:42,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2173 transitions. [2024-10-13 11:46:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:46:42,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:42,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:42,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:46:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:42,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1464587598, now seen corresponding path program 1 times [2024-10-13 11:46:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169019315] [2024-10-13 11:46:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:42,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:42,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:42,579 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:42,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:46:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:42,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:46:42,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:42,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:46:42,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:46:42,730 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:46:42,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 11:46:42,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:46:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 11:46:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:42,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:42,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169019315] [2024-10-13 11:46:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169019315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:46:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787175182] [2024-10-13 11:46:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:42,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:42,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:42,777 INFO L87 Difference]: Start difference. First operand 1541 states and 2173 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:44,031 INFO L93 Difference]: Finished difference Result 2222 states and 2656 transitions. [2024-10-13 11:46:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:46:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:44,037 INFO L225 Difference]: With dead ends: 2222 [2024-10-13 11:46:44,037 INFO L226 Difference]: Without dead ends: 2222 [2024-10-13 11:46:44,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:44,038 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 999 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:44,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 3302 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:46:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2024-10-13 11:46:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1270. [2024-10-13 11:46:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 712 states have (on average 2.162921348314607) internal successors, (1540), 1247 states have internal predecessors, (1540), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1580 transitions. [2024-10-13 11:46:44,071 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1580 transitions. Word has length 15 [2024-10-13 11:46:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:44,071 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1580 transitions. [2024-10-13 11:46:44,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1580 transitions. [2024-10-13 11:46:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:46:44,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:44,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:44,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:46:44,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:44,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash -447237995, now seen corresponding path program 1 times [2024-10-13 11:46:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900186258] [2024-10-13 11:46:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:44,277 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:44,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:46:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:44,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:46:44,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:44,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:44,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900186258] [2024-10-13 11:46:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900186258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:46:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182291903] [2024-10-13 11:46:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:44,426 INFO L87 Difference]: Start difference. First operand 1270 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:44,873 INFO L93 Difference]: Finished difference Result 1216 states and 1500 transitions. [2024-10-13 11:46:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:46:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:44,877 INFO L225 Difference]: With dead ends: 1216 [2024-10-13 11:46:44,877 INFO L226 Difference]: Without dead ends: 1216 [2024-10-13 11:46:44,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:44,878 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 61 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:44,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1860 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:46:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-10-13 11:46:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-10-13 11:46:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 682 states have (on average 2.1407624633431084) internal successors, (1460), 1193 states have internal predecessors, (1460), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1500 transitions. [2024-10-13 11:46:44,904 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1500 transitions. Word has length 15 [2024-10-13 11:46:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:44,904 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1500 transitions. [2024-10-13 11:46:44,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1500 transitions. [2024-10-13 11:46:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:46:44,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:44,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:44,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:45,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:45,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash -298985649, now seen corresponding path program 1 times [2024-10-13 11:46:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:45,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643376395] [2024-10-13 11:46:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:45,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:45,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:45,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:46:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:45,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:46:45,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:45,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:45,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643376395] [2024-10-13 11:46:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643376395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:46:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352029467] [2024-10-13 11:46:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:45,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:45,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:45,284 INFO L87 Difference]: Start difference. First operand 1216 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:45,943 INFO L93 Difference]: Finished difference Result 1200 states and 1456 transitions. [2024-10-13 11:46:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:46:45,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 11:46:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:45,948 INFO L225 Difference]: With dead ends: 1200 [2024-10-13 11:46:45,948 INFO L226 Difference]: Without dead ends: 1200 [2024-10-13 11:46:45,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:45,950 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 45 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:45,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2742 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:46:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-10-13 11:46:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2024-10-13 11:46:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 680 states have (on average 2.0823529411764707) internal successors, (1416), 1177 states have internal predecessors, (1416), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1456 transitions. [2024-10-13 11:46:45,976 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1456 transitions. Word has length 17 [2024-10-13 11:46:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:45,976 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1456 transitions. [2024-10-13 11:46:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1456 transitions. [2024-10-13 11:46:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:46:45,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:45,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:45,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:46,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1273420706, now seen corresponding path program 1 times [2024-10-13 11:46:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556730561] [2024-10-13 11:46:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:46,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:46,186 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:46,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:46:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:46,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:46:46,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:46,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:46:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:46,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:46,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:46,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556730561] [2024-10-13 11:46:46,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556730561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:46:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678260092] [2024-10-13 11:46:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:46,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:46,536 INFO L87 Difference]: Start difference. First operand 1200 states and 1456 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:49,131 INFO L93 Difference]: Finished difference Result 1686 states and 2069 transitions. [2024-10-13 11:46:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:46:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:49,136 INFO L225 Difference]: With dead ends: 1686 [2024-10-13 11:46:49,136 INFO L226 Difference]: Without dead ends: 1686 [2024-10-13 11:46:49,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:49,137 INFO L432 NwaCegarLoop]: 1128 mSDtfsCounter, 535 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:49,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2256 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:46:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-10-13 11:46:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1196. [2024-10-13 11:46:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 680 states have (on average 2.070588235294118) internal successors, (1408), 1173 states have internal predecessors, (1408), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1448 transitions. [2024-10-13 11:46:49,156 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1448 transitions. Word has length 31 [2024-10-13 11:46:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1448 transitions. [2024-10-13 11:46:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1448 transitions. [2024-10-13 11:46:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:46:49,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:49,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:49,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 11:46:49,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:49,363 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:49,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1273420707, now seen corresponding path program 1 times [2024-10-13 11:46:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241831746] [2024-10-13 11:46:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:49,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:49,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:46:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:49,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:46:49,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:49,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:46:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:49,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:49,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241831746] [2024-10-13 11:46:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241831746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:46:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311414092] [2024-10-13 11:46:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:49,595 INFO L87 Difference]: Start difference. First operand 1196 states and 1448 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:51,228 INFO L93 Difference]: Finished difference Result 1575 states and 1948 transitions. [2024-10-13 11:46:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:46:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:51,236 INFO L225 Difference]: With dead ends: 1575 [2024-10-13 11:46:51,236 INFO L226 Difference]: Without dead ends: 1575 [2024-10-13 11:46:51,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:51,241 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 728 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:51,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1376 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:46:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-13 11:46:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1192. [2024-10-13 11:46:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 680 states have (on average 2.0588235294117645) internal successors, (1400), 1169 states have internal predecessors, (1400), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1440 transitions. [2024-10-13 11:46:51,260 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1440 transitions. Word has length 31 [2024-10-13 11:46:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1440 transitions. [2024-10-13 11:46:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1440 transitions. [2024-10-13 11:46:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:46:51,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:51,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:51,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:51,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:51,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1475390164, now seen corresponding path program 1 times [2024-10-13 11:46:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:51,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348576986] [2024-10-13 11:46:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:51,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:51,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:51,468 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:51,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:46:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:51,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:46:51,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:51,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:51,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348576986] [2024-10-13 11:46:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348576986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:51,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:51,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:46:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364466236] [2024-10-13 11:46:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:51,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:51,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:51,767 INFO L87 Difference]: Start difference. First operand 1192 states and 1440 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:52,422 INFO L93 Difference]: Finished difference Result 1180 states and 1420 transitions. [2024-10-13 11:46:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:46:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-13 11:46:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:52,426 INFO L225 Difference]: With dead ends: 1180 [2024-10-13 11:46:52,426 INFO L226 Difference]: Without dead ends: 1180 [2024-10-13 11:46:52,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:46:52,427 INFO L432 NwaCegarLoop]: 914 mSDtfsCounter, 15 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:52,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2725 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:46:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-10-13 11:46:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-10-13 11:46:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 668 states have (on average 2.065868263473054) internal successors, (1380), 1157 states have internal predecessors, (1380), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 11:46:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1420 transitions. [2024-10-13 11:46:52,448 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1420 transitions. Word has length 51 [2024-10-13 11:46:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:52,449 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1420 transitions. [2024-10-13 11:46:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1420 transitions. [2024-10-13 11:46:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:46:52,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:52,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:52,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:52,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2032890965, now seen corresponding path program 1 times [2024-10-13 11:46:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607703454] [2024-10-13 11:46:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:52,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:52,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:52,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:52,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:46:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:52,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:46:52,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:53,018 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-13 11:46:53,021 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-13 11:46:53,055 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 11:46:53,055 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-13 11:46:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:53,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:53,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607703454] [2024-10-13 11:46:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607703454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:46:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179570345] [2024-10-13 11:46:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:46:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:53,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:46:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:53,282 INFO L87 Difference]: Start difference. First operand 1180 states and 1420 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:55,039 INFO L93 Difference]: Finished difference Result 2168 states and 2604 transitions. [2024-10-13 11:46:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:46:55,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 11:46:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:55,049 INFO L225 Difference]: With dead ends: 2168 [2024-10-13 11:46:55,049 INFO L226 Difference]: Without dead ends: 2168 [2024-10-13 11:46:55,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:46:55,050 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 891 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:55,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1270 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:46:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2024-10-13 11:46:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1547. [2024-10-13 11:46:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1019 states have (on average 2.045142296368989) internal successors, (2084), 1511 states have internal predecessors, (2084), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 11:46:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2150 transitions. [2024-10-13 11:46:55,078 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2150 transitions. Word has length 55 [2024-10-13 11:46:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2150 transitions. [2024-10-13 11:46:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2150 transitions. [2024-10-13 11:46:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:46:55,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:55,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:55,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:46:55,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:55,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:55,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2032890966, now seen corresponding path program 1 times [2024-10-13 11:46:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:55,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670847404] [2024-10-13 11:46:55,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:55,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:55,288 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:55,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:46:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:55,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 11:46:55,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:55,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:46:55,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-13 11:46:55,627 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:46:55,628 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-13 11:46:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:56,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:56,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:56,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670847404] [2024-10-13 11:46:56,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670847404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:56,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:46:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023528671] [2024-10-13 11:46:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:46:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:46:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:56,024 INFO L87 Difference]: Start difference. First operand 1547 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:57,885 INFO L93 Difference]: Finished difference Result 1552 states and 2156 transitions. [2024-10-13 11:46:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:46:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 11:46:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:57,893 INFO L225 Difference]: With dead ends: 1552 [2024-10-13 11:46:57,893 INFO L226 Difference]: Without dead ends: 1552 [2024-10-13 11:46:57,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:46:57,894 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 0 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:57,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1906 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:46:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-10-13 11:46:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2024-10-13 11:46:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1023 states have (on average 2.0410557184750733) internal successors, (2088), 1515 states have internal predecessors, (2088), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 11:46:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2156 transitions. [2024-10-13 11:46:57,925 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2156 transitions. Word has length 55 [2024-10-13 11:46:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:57,925 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2156 transitions. [2024-10-13 11:46:57,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:46:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2156 transitions. [2024-10-13 11:46:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:46:57,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:57,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:57,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:58,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:58,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:58,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1029791061, now seen corresponding path program 1 times [2024-10-13 11:46:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672074934] [2024-10-13 11:46:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:58,134 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:58,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:46:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:46:58,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:46:58,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:46:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:46:58,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:46:58,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:46:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672074934] [2024-10-13 11:46:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672074934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:46:58,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:46:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:46:58,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992527575] [2024-10-13 11:46:58,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:46:58,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:46:58,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:46:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:46:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:46:58,474 INFO L87 Difference]: Start difference. First operand 1552 states and 2156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:46:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:46:59,565 INFO L93 Difference]: Finished difference Result 1556 states and 2164 transitions. [2024-10-13 11:46:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:46:59,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-13 11:46:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:46:59,578 INFO L225 Difference]: With dead ends: 1556 [2024-10-13 11:46:59,579 INFO L226 Difference]: Without dead ends: 1556 [2024-10-13 11:46:59,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:46:59,582 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 19 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:46:59,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3581 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:46:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-10-13 11:46:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1554. [2024-10-13 11:46:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1024 states have (on average 2.0400390625) internal successors, (2089), 1516 states have internal predecessors, (2089), 36 states have call successors, (36), 10 states have call predecessors, (36), 8 states have return successors, (35), 28 states have call predecessors, (35), 32 states have call successors, (35) [2024-10-13 11:46:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2160 transitions. [2024-10-13 11:46:59,606 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2160 transitions. Word has length 59 [2024-10-13 11:46:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:46:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2160 transitions. [2024-10-13 11:46:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:46:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2160 transitions. [2024-10-13 11:46:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 11:46:59,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:46:59,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:46:59,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:46:59,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:59,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:46:59,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:46:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 942500470, now seen corresponding path program 1 times [2024-10-13 11:46:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:46:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537628760] [2024-10-13 11:46:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:46:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:46:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:46:59,810 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:46:59,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:47:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:00,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:47:00,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:00,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:00,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:00,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537628760] [2024-10-13 11:47:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537628760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:00,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:47:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952354060] [2024-10-13 11:47:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:00,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:47:00,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:00,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:47:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:47:00,096 INFO L87 Difference]: Start difference. First operand 1554 states and 2160 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:01,166 INFO L93 Difference]: Finished difference Result 1578 states and 2184 transitions. [2024-10-13 11:47:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:47:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-13 11:47:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:01,170 INFO L225 Difference]: With dead ends: 1578 [2024-10-13 11:47:01,171 INFO L226 Difference]: Without dead ends: 1578 [2024-10-13 11:47:01,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:47:01,172 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 13 mSDsluCounter, 3697 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:01,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4623 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:47:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-10-13 11:47:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1574. [2024-10-13 11:47:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1038 states have (on average 2.030828516377649) internal successors, (2108), 1532 states have internal predecessors, (2108), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-10-13 11:47:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2181 transitions. [2024-10-13 11:47:01,203 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2181 transitions. Word has length 62 [2024-10-13 11:47:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:01,203 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2181 transitions. [2024-10-13 11:47:01,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2181 transitions. [2024-10-13 11:47:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:47:01,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:01,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:01,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 11:47:01,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:01,408 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -383889058, now seen corresponding path program 1 times [2024-10-13 11:47:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307664827] [2024-10-13 11:47:01,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:01,410 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:01,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:47:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:01,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:47:01,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:01,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:47:01,863 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-10-13 11:47:01,875 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 11:47:01,876 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-13 11:47:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:01,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:01,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:01,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307664827] [2024-10-13 11:47:01,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307664827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:01,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:47:01,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950840054] [2024-10-13 11:47:01,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:47:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:01,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:47:01,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 11:47:01,885 INFO L87 Difference]: Start difference. First operand 1574 states and 2181 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 11:47:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:03,673 INFO L93 Difference]: Finished difference Result 1948 states and 2679 transitions. [2024-10-13 11:47:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:47:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2024-10-13 11:47:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:03,695 INFO L225 Difference]: With dead ends: 1948 [2024-10-13 11:47:03,699 INFO L226 Difference]: Without dead ends: 1948 [2024-10-13 11:47:03,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 11:47:03,700 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 693 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1388 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:03,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1316 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1362 Invalid, 0 Unknown, 1388 Unchecked, 1.7s Time] [2024-10-13 11:47:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2024-10-13 11:47:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1573. [2024-10-13 11:47:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1038 states have (on average 2.0289017341040463) internal successors, (2106), 1531 states have internal predecessors, (2106), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-10-13 11:47:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2179 transitions. [2024-10-13 11:47:03,720 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2179 transitions. Word has length 64 [2024-10-13 11:47:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:03,720 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2179 transitions. [2024-10-13 11:47:03,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 11:47:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2179 transitions. [2024-10-13 11:47:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:47:03,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:03,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:03,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 11:47:03,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:03,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:03,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash -383889057, now seen corresponding path program 1 times [2024-10-13 11:47:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:03,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094627259] [2024-10-13 11:47:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:03,929 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:03,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:47:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:04,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 11:47:04,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:04,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:47:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:47:04,673 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-10-13 11:47:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:47:04,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:47:04,696 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:47:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:47:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:04,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:04,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094627259] [2024-10-13 11:47:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094627259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:04,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:47:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180713962] [2024-10-13 11:47:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:47:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:47:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-13 11:47:04,710 INFO L87 Difference]: Start difference. First operand 1573 states and 2179 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 11:47:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:08,174 INFO L93 Difference]: Finished difference Result 2532 states and 3496 transitions. [2024-10-13 11:47:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:47:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2024-10-13 11:47:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:08,184 INFO L225 Difference]: With dead ends: 2532 [2024-10-13 11:47:08,185 INFO L226 Difference]: Without dead ends: 2532 [2024-10-13 11:47:08,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-13 11:47:08,185 INFO L432 NwaCegarLoop]: 961 mSDtfsCounter, 1330 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1822 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:08,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1803 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2345 Invalid, 0 Unknown, 1822 Unchecked, 3.4s Time] [2024-10-13 11:47:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2024-10-13 11:47:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1565. [2024-10-13 11:47:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1038 states have (on average 2.0134874759152215) internal successors, (2090), 1523 states have internal predecessors, (2090), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-10-13 11:47:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2163 transitions. [2024-10-13 11:47:08,234 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2163 transitions. Word has length 64 [2024-10-13 11:47:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:08,234 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2163 transitions. [2024-10-13 11:47:08,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-13 11:47:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2163 transitions. [2024-10-13 11:47:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 11:47:08,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:08,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:08,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 11:47:08,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:08,440 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:08,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -865899705, now seen corresponding path program 1 times [2024-10-13 11:47:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349073127] [2024-10-13 11:47:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:08,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:08,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:08,444 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:47:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:08,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 11:47:08,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:08,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:47:08,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:47:08,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:47:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:08,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:08,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349073127] [2024-10-13 11:47:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349073127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:47:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303383073] [2024-10-13 11:47:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:47:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:47:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:47:08,837 INFO L87 Difference]: Start difference. First operand 1565 states and 2163 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:47:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:12,008 INFO L93 Difference]: Finished difference Result 1576 states and 2175 transitions. [2024-10-13 11:47:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:47:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-13 11:47:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:12,014 INFO L225 Difference]: With dead ends: 1576 [2024-10-13 11:47:12,017 INFO L226 Difference]: Without dead ends: 1576 [2024-10-13 11:47:12,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:47:12,020 INFO L432 NwaCegarLoop]: 913 mSDtfsCounter, 12 mSDsluCounter, 3071 mSDsCounter, 0 mSdLazyCounter, 3221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3984 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:12,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3984 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3221 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 11:47:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2024-10-13 11:47:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1575. [2024-10-13 11:47:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1046 states have (on average 2.0095602294455066) internal successors, (2102), 1531 states have internal predecessors, (2102), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-10-13 11:47:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2175 transitions. [2024-10-13 11:47:12,035 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2175 transitions. Word has length 70 [2024-10-13 11:47:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:12,035 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2175 transitions. [2024-10-13 11:47:12,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:47:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2175 transitions. [2024-10-13 11:47:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 11:47:12,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:12,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:12,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 11:47:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:12,237 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:12,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1073087003, now seen corresponding path program 1 times [2024-10-13 11:47:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114608975] [2024-10-13 11:47:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:12,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:12,243 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 11:47:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:12,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 11:47:12,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:12,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:47:12,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:47:12,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:47:12,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:47:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:12,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:12,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114608975] [2024-10-13 11:47:12,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114608975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:12,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:12,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 11:47:12,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142411592] [2024-10-13 11:47:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:47:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:47:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:47:12,661 INFO L87 Difference]: Start difference. First operand 1575 states and 2175 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:47:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:16,919 INFO L93 Difference]: Finished difference Result 1575 states and 2173 transitions. [2024-10-13 11:47:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:47:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2024-10-13 11:47:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:16,922 INFO L225 Difference]: With dead ends: 1575 [2024-10-13 11:47:16,922 INFO L226 Difference]: Without dead ends: 1575 [2024-10-13 11:47:16,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:47:16,923 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 11 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4733 SdHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:16,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4733 Invalid, 3500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 11:47:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-13 11:47:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-10-13 11:47:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1046 states have (on average 2.0076481835564053) internal successors, (2100), 1531 states have internal predecessors, (2100), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-10-13 11:47:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2173 transitions. [2024-10-13 11:47:16,967 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2173 transitions. Word has length 71 [2024-10-13 11:47:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:16,967 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2173 transitions. [2024-10-13 11:47:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 11:47:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2173 transitions. [2024-10-13 11:47:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 11:47:16,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:16,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:16,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 11:47:17,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:17,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1810618161, now seen corresponding path program 1 times [2024-10-13 11:47:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972261459] [2024-10-13 11:47:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:17,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:17,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:17,177 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:17,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 11:47:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:17,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:47:17,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:17,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:17,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972261459] [2024-10-13 11:47:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972261459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:47:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651780530] [2024-10-13 11:47:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:17,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:47:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:47:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:47:17,522 INFO L87 Difference]: Start difference. First operand 1575 states and 2173 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-13 11:47:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:18,455 INFO L93 Difference]: Finished difference Result 1583 states and 2183 transitions. [2024-10-13 11:47:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:47:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 76 [2024-10-13 11:47:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:18,461 INFO L225 Difference]: With dead ends: 1583 [2024-10-13 11:47:18,461 INFO L226 Difference]: Without dead ends: 1581 [2024-10-13 11:47:18,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:47:18,462 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 3 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:18,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3654 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:47:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-13 11:47:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2024-10-13 11:47:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1050 states have (on average 2.005714285714286) internal successors, (2106), 1537 states have internal predecessors, (2106), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-10-13 11:47:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2181 transitions. [2024-10-13 11:47:18,477 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2181 transitions. Word has length 76 [2024-10-13 11:47:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:18,478 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2181 transitions. [2024-10-13 11:47:18,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-13 11:47:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2181 transitions. [2024-10-13 11:47:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 11:47:18,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:18,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:18,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-13 11:47:18,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:18,683 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:18,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1376702615, now seen corresponding path program 1 times [2024-10-13 11:47:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266495286] [2024-10-13 11:47:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:18,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:18,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:18,687 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:18,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 11:47:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:18,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:47:19,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:19,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:47:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:19,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:19,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266495286] [2024-10-13 11:47:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266495286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:47:19,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:47:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 11:47:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300392726] [2024-10-13 11:47:19,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:47:19,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:47:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:47:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:47:19,125 INFO L87 Difference]: Start difference. First operand 1581 states and 2181 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:20,104 INFO L93 Difference]: Finished difference Result 1595 states and 2199 transitions. [2024-10-13 11:47:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:47:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2024-10-13 11:47:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:20,108 INFO L225 Difference]: With dead ends: 1595 [2024-10-13 11:47:20,108 INFO L226 Difference]: Without dead ends: 1591 [2024-10-13 11:47:20,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 11:47:20,109 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:20,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3655 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:47:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2024-10-13 11:47:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1589. [2024-10-13 11:47:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1058 states have (on average 2.0) internal successors, (2116), 1545 states have internal predecessors, (2116), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-10-13 11:47:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2191 transitions. [2024-10-13 11:47:20,133 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2191 transitions. Word has length 77 [2024-10-13 11:47:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2191 transitions. [2024-10-13 11:47:20,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2191 transitions. [2024-10-13 11:47:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 11:47:20,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:20,134 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:20,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-13 11:47:20,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:20,335 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1502740657, now seen corresponding path program 2 times [2024-10-13 11:47:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465557445] [2024-10-13 11:47:20,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:47:20,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:20,339 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:20,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 11:47:20,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:47:20,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:47:20,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:47:20,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:20,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:47:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:21,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465557445] [2024-10-13 11:47:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465557445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:47:21,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:47:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 11:47:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103842277] [2024-10-13 11:47:21,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:47:21,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 11:47:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:21,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 11:47:21,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-13 11:47:21,170 INFO L87 Difference]: Start difference. First operand 1589 states and 2191 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:23,042 INFO L93 Difference]: Finished difference Result 1613 states and 2229 transitions. [2024-10-13 11:47:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 11:47:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2024-10-13 11:47:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:23,050 INFO L225 Difference]: With dead ends: 1613 [2024-10-13 11:47:23,050 INFO L226 Difference]: Without dead ends: 1609 [2024-10-13 11:47:23,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-10-13 11:47:23,051 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 29 mSDsluCounter, 6387 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7304 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:23,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7304 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:47:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-10-13 11:47:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1607. [2024-10-13 11:47:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1076 states have (on average 1.9888475836431228) internal successors, (2140), 1563 states have internal predecessors, (2140), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-10-13 11:47:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2215 transitions. [2024-10-13 11:47:23,066 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2215 transitions. Word has length 80 [2024-10-13 11:47:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:23,066 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2215 transitions. [2024-10-13 11:47:23,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2215 transitions. [2024-10-13 11:47:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 11:47:23,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:23,071 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:23,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-13 11:47:23,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:23,272 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:23,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -953014001, now seen corresponding path program 3 times [2024-10-13 11:47:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870907287] [2024-10-13 11:47:23,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:47:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:23,274 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:23,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 11:47:24,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:47:24,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:47:24,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 11:47:24,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:24,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:47:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:24,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870907287] [2024-10-13 11:47:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870907287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:47:24,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:47:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-13 11:47:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084701768] [2024-10-13 11:47:24,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:47:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 11:47:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 11:47:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-10-13 11:47:24,979 INFO L87 Difference]: Start difference. First operand 1607 states and 2215 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:30,677 INFO L93 Difference]: Finished difference Result 1649 states and 2287 transitions. [2024-10-13 11:47:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-13 11:47:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 86 [2024-10-13 11:47:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:30,680 INFO L225 Difference]: With dead ends: 1649 [2024-10-13 11:47:30,680 INFO L226 Difference]: Without dead ends: 1643 [2024-10-13 11:47:30,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 11:47:30,681 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 48 mSDsluCounter, 10955 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 11872 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:30,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 11872 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 11:47:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-10-13 11:47:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2024-10-13 11:47:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1112 states have (on average 1.9658273381294964) internal successors, (2186), 1599 states have internal predecessors, (2186), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-10-13 11:47:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2261 transitions. [2024-10-13 11:47:30,696 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2261 transitions. Word has length 86 [2024-10-13 11:47:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:30,696 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2261 transitions. [2024-10-13 11:47:30,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2261 transitions. [2024-10-13 11:47:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 11:47:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:30,697 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:30,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-13 11:47:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:30,902 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -902591345, now seen corresponding path program 4 times [2024-10-13 11:47:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225320235] [2024-10-13 11:47:30,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:47:30,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:30,908 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:30,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 11:47:31,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:47:31,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:47:31,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 11:47:31,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:32,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:47:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:33,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225320235] [2024-10-13 11:47:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225320235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:47:33,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:47:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 11:47:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983118101] [2024-10-13 11:47:33,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:47:33,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 11:47:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 11:47:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 11:47:33,587 INFO L87 Difference]: Start difference. First operand 1643 states and 2261 transitions. Second operand has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:49,890 INFO L93 Difference]: Finished difference Result 1717 states and 2399 transitions. [2024-10-13 11:47:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-13 11:47:49,893 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2024-10-13 11:47:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:49,896 INFO L225 Difference]: With dead ends: 1717 [2024-10-13 11:47:49,896 INFO L226 Difference]: Without dead ends: 1713 [2024-10-13 11:47:49,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-10-13 11:47:49,899 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 84 mSDsluCounter, 22823 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 23740 SdHoareTripleChecker+Invalid, 4247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:49,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 23740 Invalid, 4247 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-10-13 11:47:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2024-10-13 11:47:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1711. [2024-10-13 11:47:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1180 states have (on average 1.9305084745762713) internal successors, (2278), 1667 states have internal predecessors, (2278), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-10-13 11:47:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2353 transitions. [2024-10-13 11:47:49,919 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2353 transitions. Word has length 98 [2024-10-13 11:47:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:49,920 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2353 transitions. [2024-10-13 11:47:49,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 11:47:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2353 transitions. [2024-10-13 11:47:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 11:47:49,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:49,921 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:49,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-10-13 11:47:50,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:50,122 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-10-13 11:47:50,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -494297009, now seen corresponding path program 5 times [2024-10-13 11:47:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:50,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468905369] [2024-10-13 11:47:50,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:47:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:50,126 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process