./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:40:54,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:40:54,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:40:54,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:40:54,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:40:54,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:40:54,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:40:54,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:40:54,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:40:54,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:40:54,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:40:54,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:40:54,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:40:54,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:40:54,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:40:54,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:40:54,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:40:54,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:40:54,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:40:54,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:40:54,464 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:40:54,464 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:40:54,464 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:40:54,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:40:54,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:40:54,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:40:54,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:40:54,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:40:54,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:40:54,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:40:54,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:40:54,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:40:54,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:40:54,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:40:54,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:40:54,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:40:54,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:40:54,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:40:54,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:40:54,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:40:54,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:40:54,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:40:54,471 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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2024-11-12 15:40:54,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:40:54,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:40:54,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:40:54,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:40:54,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:40:54,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 15:40:56,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:40:56,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:40:56,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 15:40:56,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643d0dd44/f10e165501dd4e1c985168317f79f9c4/FLAG5cb7a5f01 [2024-11-12 15:40:56,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643d0dd44/f10e165501dd4e1c985168317f79f9c4 [2024-11-12 15:40:56,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:40:56,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:40:56,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:40:56,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:40:56,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:40:56,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:40:56" (1/1) ... [2024-11-12 15:40:56,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ce2c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:56, skipping insertion in model container [2024-11-12 15:40:56,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:40:56" (1/1) ... [2024-11-12 15:40:56,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:40:57,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,514 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,519 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,570 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,585 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,595 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,596 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,598 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,603 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,604 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,604 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:40:57,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:40:57,638 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 15:40:57,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@403251b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:57, skipping insertion in model container [2024-11-12 15:40:57,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:40:57,639 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 15:40:57,640 INFO L158 Benchmark]: Toolchain (without parser) took 772.26ms. Allocated memory is still 165.7MB. Free memory was 93.9MB in the beginning and 117.9MB in the end (delta: -24.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-12 15:40:57,641 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:40:57,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.16ms. Allocated memory is still 165.7MB. Free memory was 93.7MB in the beginning and 117.9MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-12 15:40:57,643 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.20ms. Allocated memory is still 165.7MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.16ms. Allocated memory is still 165.7MB. Free memory was 93.7MB in the beginning and 117.9MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:40:59,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:40:59,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:40:59,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:40:59,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:40:59,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:40:59,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:40:59,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:40:59,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:40:59,768 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:40:59,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:40:59,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:40:59,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:40:59,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:40:59,772 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:40:59,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:40:59,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:40:59,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:40:59,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:40:59,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:40:59,773 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:40:59,777 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:40:59,777 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:40:59,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:40:59,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:40:59,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:40:59,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:40:59,779 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:40:59,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:40:59,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:40:59,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:40:59,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:40:59,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:40:59,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:40:59,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:40:59,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:40:59,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:40:59,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:40:59,782 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:40:59,782 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:40:59,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:40:59,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:40:59,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:40:59,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:40:59,784 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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2024-11-12 15:41:00,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:41:00,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:41:00,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:41:00,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:41:00,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:41:00,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 15:41:01,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:41:02,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:41:02,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-12 15:41:02,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2b4c1a4/5e4e69fd03884cb7b1323d1db4603023/FLAGc2ad056f1 [2024-11-12 15:41:02,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2b4c1a4/5e4e69fd03884cb7b1323d1db4603023 [2024-11-12 15:41:02,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:41:02,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:41:02,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:41:02,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:41:02,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:41:02,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:41:02" (1/1) ... [2024-11-12 15:41:02,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec51867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:02, skipping insertion in model container [2024-11-12 15:41:02,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:41:02" (1/1) ... [2024-11-12 15:41:02,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:41:02,958 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:02,986 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:02,989 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:02,997 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,004 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,064 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,073 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,076 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,081 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,089 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,094 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,096 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,099 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,100 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,108 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:41:03,140 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 15:41:03,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:41:03,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,219 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,224 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,227 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,238 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,261 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,263 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,263 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,265 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,265 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,268 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,269 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,271 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,277 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:41:03,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:41:03,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:41:03,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:41:03,445 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:41:03,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03 WrapperNode [2024-11-12 15:41:03,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:41:03,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:41:03,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:41:03,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:41:03,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,583 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1243 [2024-11-12 15:41:03,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:41:03,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:41:03,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:41:03,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:41:03,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,700 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-12 15:41:03,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:41:03,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:41:03,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:41:03,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:41:03,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (1/1) ... [2024-11-12 15:41:03,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:41:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:41:03,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 15:41:03,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 15:41:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 15:41:03,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 15:41:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:41:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 15:41:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 15:41:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 15:41:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 15:41:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-12 15:41:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-12 15:41:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:41:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:41:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:41:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-12 15:41:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 15:41:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-12 15:41:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-12 15:41:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:41:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:41:04,158 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:41:04,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:41:08,317 INFO L? ?]: Removed 1307 outVars from TransFormulas that were not future-live. [2024-11-12 15:41:08,318 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:41:08,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:41:08,374 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-12 15:41:08,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:08 BoogieIcfgContainer [2024-11-12 15:41:08,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:41:08,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:41:08,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:41:08,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:41:08,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:41:02" (1/3) ... [2024-11-12 15:41:08,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d5db87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:08, skipping insertion in model container [2024-11-12 15:41:08,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:03" (2/3) ... [2024-11-12 15:41:08,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d5db87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:08, skipping insertion in model container [2024-11-12 15:41:08,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:08" (3/3) ... [2024-11-12 15:41:08,383 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-2.i [2024-11-12 15:41:08,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:41:08,397 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-12 15:41:08,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:41:08,476 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;@31fe264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:41:08,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-12 15:41:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 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-11-12 15:41:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:41:08,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:08,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:41:08,488 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-11-12 15:41:08,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-12 15:41:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694296592] [2024-11-12 15:41:08,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:08,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:08,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:08,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 15:41:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:08,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:41:08,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:08,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:08,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694296592] [2024-11-12 15:41:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694296592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:41:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65521946] [2024-11-12 15:41:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:41:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:41:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:08,830 INFO L87 Difference]: Start difference. First operand has 1284 states, 634 states have (on average 2.2145110410094637) internal successors, (1404), 1262 states have internal predecessors, (1404), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:10,607 INFO L93 Difference]: Finished difference Result 1544 states and 1637 transitions. [2024-11-12 15:41:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:41:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 15:41:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:10,631 INFO L225 Difference]: With dead ends: 1544 [2024-11-12 15:41:10,631 INFO L226 Difference]: Without dead ends: 1542 [2024-11-12 15:41:10,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:10,636 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 914 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:10,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1260 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:41:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-12 15:41:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1305. [2024-11-12 15:41:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 670 states have (on average 2.0791044776119403) internal successors, (1393), 1285 states have internal predecessors, (1393), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 15:41:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1427 transitions. [2024-11-12 15:41:10,732 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1427 transitions. Word has length 3 [2024-11-12 15:41:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:10,733 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1427 transitions. [2024-11-12 15:41:10,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1427 transitions. [2024-11-12 15:41:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:41:10,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:10,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:41:10,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:10,937 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-11-12 15:41:10,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-12 15:41:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217462352] [2024-11-12 15:41:10,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:10,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:10,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 15:41:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:11,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:41:11,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:11,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:11,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:11,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217462352] [2024-11-12 15:41:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217462352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:11,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:41:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103075140] [2024-11-12 15:41:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:11,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:41:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:11,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:41:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:11,106 INFO L87 Difference]: Start difference. First operand 1305 states and 1427 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:13,374 INFO L93 Difference]: Finished difference Result 1908 states and 2080 transitions. [2024-11-12 15:41:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:41:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 15:41:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:13,381 INFO L225 Difference]: With dead ends: 1908 [2024-11-12 15:41:13,381 INFO L226 Difference]: Without dead ends: 1908 [2024-11-12 15:41:13,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:13,382 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 636 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:13,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1760 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 15:41:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2024-11-12 15:41:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1518. [2024-11-12 15:41:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 882 states have (on average 2.061224489795918) internal successors, (1818), 1496 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-11-12 15:41:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1856 transitions. [2024-11-12 15:41:13,415 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1856 transitions. Word has length 3 [2024-11-12 15:41:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:13,416 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1856 transitions. [2024-11-12 15:41:13,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1856 transitions. [2024-11-12 15:41:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:41:13,416 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:13,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:13,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 15:41:13,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:13,618 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-11-12 15:41:13,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-12 15:41:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207603962] [2024-11-12 15:41:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:13,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:13,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:41:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:13,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:41:13,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:13,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:13,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:13,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:41:13,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 15:41:13,937 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:41:13,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 15:41:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:13,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:13,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207603962] [2024-11-12 15:41:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207603962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:41:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744621927] [2024-11-12 15:41:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:13,975 INFO L87 Difference]: Start difference. First operand 1518 states and 1856 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:18,302 INFO L93 Difference]: Finished difference Result 2603 states and 3022 transitions. [2024-11-12 15:41:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:41:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 15:41:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:18,310 INFO L225 Difference]: With dead ends: 2603 [2024-11-12 15:41:18,310 INFO L226 Difference]: Without dead ends: 2603 [2024-11-12 15:41:18,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:18,312 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1129 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:18,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1813 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 15:41:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-11-12 15:41:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1667. [2024-11-12 15:41:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1031 states have (on average 2.0417070805043647) internal successors, (2105), 1645 states have internal predecessors, (2105), 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-11-12 15:41:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2143 transitions. [2024-11-12 15:41:18,347 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2143 transitions. Word has length 8 [2024-11-12 15:41:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:18,349 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2143 transitions. [2024-11-12 15:41:18,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2143 transitions. [2024-11-12 15:41:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 15:41:18,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:18,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:18,355 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-11-12 15:41:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:18,555 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-11-12 15:41:18,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-12 15:41:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935092181] [2024-11-12 15:41:18,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:18,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:18,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 15:41:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:18,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:41:18,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:18,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:18,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:18,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935092181] [2024-11-12 15:41:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935092181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:41:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272044117] [2024-11-12 15:41:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:18,730 INFO L87 Difference]: Start difference. First operand 1667 states and 2143 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:20,764 INFO L93 Difference]: Finished difference Result 2214 states and 2918 transitions. [2024-11-12 15:41:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 15:41:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:20,771 INFO L225 Difference]: With dead ends: 2214 [2024-11-12 15:41:20,771 INFO L226 Difference]: Without dead ends: 2214 [2024-11-12 15:41:20,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:20,772 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 924 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:20,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2518 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 15:41:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-12 15:41:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1622. [2024-11-12 15:41:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1031 states have (on average 1.9844810863239573) internal successors, (2046), 1600 states have internal predecessors, (2046), 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-11-12 15:41:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2084 transitions. [2024-11-12 15:41:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2084 transitions. Word has length 9 [2024-11-12 15:41:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:20,811 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2084 transitions. [2024-11-12 15:41:20,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2084 transitions. [2024-11-12 15:41:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 15:41:20,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:20,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:20,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 15:41:21,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:21,015 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-11-12 15:41:21,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-12 15:41:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844716894] [2024-11-12 15:41:21,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:21,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 15:41:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:21,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:41:21,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:21,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:21,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844716894] [2024-11-12 15:41:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844716894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:41:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570959191] [2024-11-12 15:41:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:21,210 INFO L87 Difference]: Start difference. First operand 1622 states and 2084 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:23,614 INFO L93 Difference]: Finished difference Result 2278 states and 2940 transitions. [2024-11-12 15:41:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 15:41:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:23,621 INFO L225 Difference]: With dead ends: 2278 [2024-11-12 15:41:23,621 INFO L226 Difference]: Without dead ends: 2278 [2024-11-12 15:41:23,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:23,622 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 704 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:23,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2873 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 15:41:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2024-11-12 15:41:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1614. [2024-11-12 15:41:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1033 states have (on average 1.9593417231364956) internal successors, (2024), 1592 states have internal predecessors, (2024), 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-11-12 15:41:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2062 transitions. [2024-11-12 15:41:23,655 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2062 transitions. Word has length 9 [2024-11-12 15:41:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2062 transitions. [2024-11-12 15:41:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2062 transitions. [2024-11-12 15:41:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 15:41:23,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:23,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:23,663 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-11-12 15:41:23,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:23,859 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-11-12 15:41:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -325292811, now seen corresponding path program 1 times [2024-11-12 15:41:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711850366] [2024-11-12 15:41:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:23,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:23,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:23,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:23,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 15:41:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:41:24,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:24,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:24,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:24,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711850366] [2024-11-12 15:41:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711850366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358459067] [2024-11-12 15:41:24,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:24,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:24,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:24,062 INFO L87 Difference]: Start difference. First operand 1614 states and 2062 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:24,707 INFO L93 Difference]: Finished difference Result 2240 states and 2833 transitions. [2024-11-12 15:41:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:41:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 15:41:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:24,714 INFO L225 Difference]: With dead ends: 2240 [2024-11-12 15:41:24,714 INFO L226 Difference]: Without dead ends: 2240 [2024-11-12 15:41:24,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:24,715 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 640 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:24,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 3950 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 15:41:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-12 15:41:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1877. [2024-11-12 15:41:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1293 states have (on average 1.9651972157772621) internal successors, (2541), 1852 states have internal predecessors, (2541), 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-11-12 15:41:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2585 transitions. [2024-11-12 15:41:24,761 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2585 transitions. Word has length 13 [2024-11-12 15:41:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:24,761 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2585 transitions. [2024-11-12 15:41:24,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2585 transitions. [2024-11-12 15:41:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 15:41:24,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:24,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:24,768 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:24,964 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-11-12 15:41:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-12 15:41:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789279717] [2024-11-12 15:41:24,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:24,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:24,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:24,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:24,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:41:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:25,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:41:25,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:25,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:25,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789279717] [2024-11-12 15:41:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789279717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:41:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189816523] [2024-11-12 15:41:25,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:25,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:41:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:41:25,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:25,145 INFO L87 Difference]: Start difference. First operand 1877 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:25,178 INFO L93 Difference]: Finished difference Result 1781 states and 2413 transitions. [2024-11-12 15:41:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:41:25,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 15:41:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:25,186 INFO L225 Difference]: With dead ends: 1781 [2024-11-12 15:41:25,186 INFO L226 Difference]: Without dead ends: 1781 [2024-11-12 15:41:25,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:25,187 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 71 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:25,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2395 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2024-11-12 15:41:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2024-11-12 15:41:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1221 states have (on average 1.9402129402129402) internal successors, (2369), 1756 states have internal predecessors, (2369), 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-11-12 15:41:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2413 transitions. [2024-11-12 15:41:25,219 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2413 transitions. Word has length 13 [2024-11-12 15:41:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:25,219 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2413 transitions. [2024-11-12 15:41:25,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2413 transitions. [2024-11-12 15:41:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 15:41:25,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:25,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:25,226 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:25,425 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-11-12 15:41:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1177229704, now seen corresponding path program 1 times [2024-11-12 15:41:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739452602] [2024-11-12 15:41:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:25,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:25,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:25,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 15:41:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:25,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:41:25,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:25,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:41:25,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:41:25,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:41:25,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-12 15:41:25,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 15:41:25,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-12 15:41:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:25,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:25,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739452602] [2024-11-12 15:41:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739452602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419269116] [2024-11-12 15:41:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:25,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:25,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:25,663 INFO L87 Difference]: Start difference. First operand 1781 states and 2413 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:25,928 INFO L93 Difference]: Finished difference Result 2505 states and 2939 transitions. [2024-11-12 15:41:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:41:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 15:41:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:25,933 INFO L225 Difference]: With dead ends: 2505 [2024-11-12 15:41:25,934 INFO L226 Difference]: Without dead ends: 2505 [2024-11-12 15:41:25,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:25,934 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 1107 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:25,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 4096 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:41:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-12 15:41:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1446. [2024-11-12 15:41:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 888 states have (on average 1.9324324324324325) internal successors, (1716), 1423 states have internal predecessors, (1716), 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-11-12 15:41:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1756 transitions. [2024-11-12 15:41:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1756 transitions. Word has length 16 [2024-11-12 15:41:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1756 transitions. [2024-11-12 15:41:25,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1756 transitions. [2024-11-12 15:41:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 15:41:25,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:25,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:25,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 15:41:26,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:26,164 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-11-12 15:41:26,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-12 15:41:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759619124] [2024-11-12 15:41:26,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:26,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:26,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:26,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 15:41:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:26,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:41:26,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:26,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:26,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759619124] [2024-11-12 15:41:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759619124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:41:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628593677] [2024-11-12 15:41:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:26,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:41:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:41:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:26,388 INFO L87 Difference]: Start difference. First operand 1446 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:26,417 INFO L93 Difference]: Finished difference Result 1386 states and 1670 transitions. [2024-11-12 15:41:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:41:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 15:41:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:26,422 INFO L225 Difference]: With dead ends: 1386 [2024-11-12 15:41:26,422 INFO L226 Difference]: Without dead ends: 1386 [2024-11-12 15:41:26,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:41:26,425 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 71 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:26,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2309 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-12 15:41:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-11-12 15:41:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 852 states have (on average 1.9131455399061033) internal successors, (1630), 1363 states have internal predecessors, (1630), 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-11-12 15:41:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1670 transitions. [2024-11-12 15:41:26,445 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1670 transitions. Word has length 19 [2024-11-12 15:41:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:26,445 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1670 transitions. [2024-11-12 15:41:26,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1670 transitions. [2024-11-12 15:41:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 15:41:26,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:26,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:26,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 15:41:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:26,647 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-11-12 15:41:26,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-12 15:41:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188449927] [2024-11-12 15:41:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:26,649 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 15:41:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:26,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:41:26,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:26,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:26,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188449927] [2024-11-12 15:41:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188449927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308997265] [2024-11-12 15:41:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:26,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:26,861 INFO L87 Difference]: Start difference. First operand 1386 states and 1670 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:26,930 INFO L93 Difference]: Finished difference Result 1356 states and 1612 transitions. [2024-11-12 15:41:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 15:41:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:26,934 INFO L225 Difference]: With dead ends: 1356 [2024-11-12 15:41:26,934 INFO L226 Difference]: Without dead ends: 1356 [2024-11-12 15:41:26,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:26,935 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 48 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:26,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3397 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-12 15:41:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2024-11-12 15:41:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 836 states have (on average 1.8803827751196172) internal successors, (1572), 1333 states have internal predecessors, (1572), 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-11-12 15:41:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1612 transitions. [2024-11-12 15:41:26,959 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1612 transitions. Word has length 21 [2024-11-12 15:41:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:26,960 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1612 transitions. [2024-11-12 15:41:26,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1612 transitions. [2024-11-12 15:41:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 15:41:26,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:26,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:26,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 15:41:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:27,168 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-11-12 15:41:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-12 15:41:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053286516] [2024-11-12 15:41:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:27,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:27,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:27,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 15:41:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:27,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 15:41:27,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:27,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:27,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053286516] [2024-11-12 15:41:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053286516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43890130] [2024-11-12 15:41:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:41:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:41:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:27,603 INFO L87 Difference]: Start difference. First operand 1356 states and 1612 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:30,422 INFO L93 Difference]: Finished difference Result 1909 states and 2292 transitions. [2024-11-12 15:41:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:41:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 15:41:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:30,428 INFO L225 Difference]: With dead ends: 1909 [2024-11-12 15:41:30,428 INFO L226 Difference]: Without dead ends: 1909 [2024-11-12 15:41:30,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:41:30,429 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 594 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:30,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3658 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 15:41:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2024-11-12 15:41:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1352. [2024-11-12 15:41:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 836 states have (on average 1.8708133971291867) internal successors, (1564), 1329 states have internal predecessors, (1564), 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-11-12 15:41:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1604 transitions. [2024-11-12 15:41:30,447 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1604 transitions. Word has length 35 [2024-11-12 15:41:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:30,449 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1604 transitions. [2024-11-12 15:41:30,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1604 transitions. [2024-11-12 15:41:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 15:41:30,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:30,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:30,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 15:41:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:30,654 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-11-12 15:41:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-12 15:41:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:30,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569232244] [2024-11-12 15:41:30,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:30,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:30,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 15:41:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:30,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:41:30,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:30,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:30,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:30,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569232244] [2024-11-12 15:41:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569232244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663508873] [2024-11-12 15:41:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:30,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:41:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:41:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:30,938 INFO L87 Difference]: Start difference. First operand 1352 states and 1604 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:32,881 INFO L93 Difference]: Finished difference Result 1778 states and 2151 transitions. [2024-11-12 15:41:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:41:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-12 15:41:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:32,888 INFO L225 Difference]: With dead ends: 1778 [2024-11-12 15:41:32,888 INFO L226 Difference]: Without dead ends: 1778 [2024-11-12 15:41:32,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:41:32,889 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 810 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:32,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2287 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 15:41:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2024-11-12 15:41:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1348. [2024-11-12 15:41:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 836 states have (on average 1.861244019138756) internal successors, (1556), 1325 states have internal predecessors, (1556), 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-11-12 15:41:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1596 transitions. [2024-11-12 15:41:32,908 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1596 transitions. Word has length 35 [2024-11-12 15:41:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:32,908 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1596 transitions. [2024-11-12 15:41:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1596 transitions. [2024-11-12 15:41:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 15:41:32,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:32,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:32,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 15:41:33,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:33,112 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-11-12 15:41:33,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 103975123, now seen corresponding path program 1 times [2024-11-12 15:41:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429218707] [2024-11-12 15:41:33,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:33,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:33,117 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:33,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 15:41:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:41:33,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:33,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:33,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429218707] [2024-11-12 15:41:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429218707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:33,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:33,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653404631] [2024-11-12 15:41:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:33,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:41:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:41:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:41:33,447 INFO L87 Difference]: Start difference. First operand 1348 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:33,497 INFO L93 Difference]: Finished difference Result 1336 states and 1576 transitions. [2024-11-12 15:41:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-12 15:41:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:33,501 INFO L225 Difference]: With dead ends: 1336 [2024-11-12 15:41:33,501 INFO L226 Difference]: Without dead ends: 1336 [2024-11-12 15:41:33,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:33,502 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 21 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:33,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3374 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-11-12 15:41:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2024-11-12 15:41:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 824 states have (on average 1.8640776699029127) internal successors, (1536), 1313 states have internal predecessors, (1536), 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-11-12 15:41:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1576 transitions. [2024-11-12 15:41:33,525 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1576 transitions. Word has length 55 [2024-11-12 15:41:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:33,525 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1576 transitions. [2024-11-12 15:41:33,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1576 transitions. [2024-11-12 15:41:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 15:41:33,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:33,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:33,539 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-11-12 15:41:33,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:33,728 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-11-12 15:41:33,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash -635878753, now seen corresponding path program 1 times [2024-11-12 15:41:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608750192] [2024-11-12 15:41:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:33,731 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:33,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 15:41:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:34,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 15:41:34,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:34,235 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-12 15:41:34,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 15:41:34,305 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-12 15:41:34,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-12 15:41:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:34,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:34,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608750192] [2024-11-12 15:41:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608750192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116862714] [2024-11-12 15:41:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:34,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:41:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:41:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:41:34,687 INFO L87 Difference]: Start difference. First operand 1336 states and 1576 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:37,511 INFO L93 Difference]: Finished difference Result 2445 states and 2881 transitions. [2024-11-12 15:41:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:41:37,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-12 15:41:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:37,518 INFO L225 Difference]: With dead ends: 2445 [2024-11-12 15:41:37,518 INFO L226 Difference]: Without dead ends: 2445 [2024-11-12 15:41:37,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:41:37,519 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1945 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:37,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2706 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 15:41:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2024-11-12 15:41:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1785. [2024-11-12 15:41:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1257 states have (on average 1.847255369928401) internal successors, (2322), 1749 states have internal predecessors, (2322), 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-11-12 15:41:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2388 transitions. [2024-11-12 15:41:37,544 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2388 transitions. Word has length 63 [2024-11-12 15:41:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:37,544 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2388 transitions. [2024-11-12 15:41:37,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2388 transitions. [2024-11-12 15:41:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 15:41:37,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:37,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:37,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:37,747 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-11-12 15:41:37,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash -635878752, now seen corresponding path program 1 times [2024-11-12 15:41:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:37,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626564488] [2024-11-12 15:41:37,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:37,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:37,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:37,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 15:41:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:38,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 15:41:38,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:38,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:41:38,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 15:41:38,230 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 15:41:38,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 15:41:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:38,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:38,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626564488] [2024-11-12 15:41:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626564488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:41:38,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548377379] [2024-11-12 15:41:38,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:41:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:41:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:41:38,786 INFO L87 Difference]: Start difference. First operand 1785 states and 2388 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:40,669 INFO L93 Difference]: Finished difference Result 1790 states and 2394 transitions. [2024-11-12 15:41:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-12 15:41:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:40,680 INFO L225 Difference]: With dead ends: 1790 [2024-11-12 15:41:40,680 INFO L226 Difference]: Without dead ends: 1790 [2024-11-12 15:41:40,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:41:40,680 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 58 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:40,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2383 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 15:41:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-12 15:41:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2024-11-12 15:41:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1261 states have (on average 1.84456780333069) internal successors, (2326), 1753 states have internal predecessors, (2326), 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-11-12 15:41:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2394 transitions. [2024-11-12 15:41:40,705 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2394 transitions. Word has length 63 [2024-11-12 15:41:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:40,706 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2394 transitions. [2024-11-12 15:41:40,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2394 transitions. [2024-11-12 15:41:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 15:41:40,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:40,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:40,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 15:41:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:40,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-12 15:41:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 735482981, now seen corresponding path program 1 times [2024-11-12 15:41:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918106233] [2024-11-12 15:41:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:40,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:40,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:40,913 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:40,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 15:41:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:41,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:41:41,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:41,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:41,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918106233] [2024-11-12 15:41:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918106233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:41:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800097939] [2024-11-12 15:41:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:41,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:41:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:41:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:41:41,227 INFO L87 Difference]: Start difference. First operand 1790 states and 2394 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:41,299 INFO L93 Difference]: Finished difference Result 1816 states and 2421 transitions. [2024-11-12 15:41:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:41:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-12 15:41:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:41,304 INFO L225 Difference]: With dead ends: 1816 [2024-11-12 15:41:41,304 INFO L226 Difference]: Without dead ends: 1816 [2024-11-12 15:41:41,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:41:41,305 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 15 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:41,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5720 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-12 15:41:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1814. [2024-11-12 15:41:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1279 states have (on average 1.836591086786552) internal successors, (2349), 1773 states have internal predecessors, (2349), 38 states have call successors, (38), 14 states have call predecessors, (38), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 15:41:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2421 transitions. [2024-11-12 15:41:41,332 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2421 transitions. Word has length 71 [2024-11-12 15:41:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:41,332 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2421 transitions. [2024-11-12 15:41:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:41:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2421 transitions. [2024-11-12 15:41:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 15:41:41,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:41,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:41,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-12 15:41:41,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:41,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-12 15:41:41,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1006494928, now seen corresponding path program 1 times [2024-11-12 15:41:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373287383] [2024-11-12 15:41:41,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:41,539 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:41,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 15:41:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:41,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:41:41,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:41,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:41,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373287383] [2024-11-12 15:41:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373287383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:41:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174038043] [2024-11-12 15:41:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:41,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:41:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:41:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:41:41,918 INFO L87 Difference]: Start difference. First operand 1814 states and 2421 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:41:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:42,164 INFO L93 Difference]: Finished difference Result 1826 states and 2435 transitions. [2024-11-12 15:41:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 15:41:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-11-12 15:41:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:42,171 INFO L225 Difference]: With dead ends: 1826 [2024-11-12 15:41:42,171 INFO L226 Difference]: Without dead ends: 1826 [2024-11-12 15:41:42,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:41:42,172 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 22 mSDsluCounter, 4416 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:42,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5545 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:41:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-12 15:41:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-12 15:41:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1281 states have (on average 1.8352849336455894) internal successors, (2351), 1775 states have internal predecessors, (2351), 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-11-12 15:41:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2424 transitions. [2024-11-12 15:41:42,206 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2424 transitions. Word has length 69 [2024-11-12 15:41:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:42,206 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2424 transitions. [2024-11-12 15:41:42,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:41:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2424 transitions. [2024-11-12 15:41:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 15:41:42,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:42,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:42,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:42,409 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-11-12 15:41:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454463, now seen corresponding path program 1 times [2024-11-12 15:41:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505887879] [2024-11-12 15:41:42,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:42,414 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:42,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-12 15:41:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:42,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:41:42,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:42,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:42,957 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-12 15:41:42,977 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 15:41:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 15:41:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:42,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:42,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:42,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505887879] [2024-11-12 15:41:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505887879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:41:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460705132] [2024-11-12 15:41:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:41:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:41:42,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-12 15:41:42,989 INFO L87 Difference]: Start difference. First operand 1817 states and 2424 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:45,387 INFO L93 Difference]: Finished difference Result 2238 states and 2969 transitions. [2024-11-12 15:41:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 15:41:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-12 15:41:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:45,391 INFO L225 Difference]: With dead ends: 2238 [2024-11-12 15:41:45,391 INFO L226 Difference]: Without dead ends: 2238 [2024-11-12 15:41:45,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-12 15:41:45,392 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 771 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1538 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:45,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2184 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1922 Invalid, 0 Unknown, 1538 Unchecked, 2.3s Time] [2024-11-12 15:41:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2024-11-12 15:41:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1816. [2024-11-12 15:41:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1281 states have (on average 1.8337236533957846) internal successors, (2349), 1774 states have internal predecessors, (2349), 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-11-12 15:41:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2422 transitions. [2024-11-12 15:41:45,418 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2422 transitions. Word has length 74 [2024-11-12 15:41:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:45,419 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2422 transitions. [2024-11-12 15:41:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2422 transitions. [2024-11-12 15:41:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 15:41:45,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:45,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:45,431 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 (19)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:45,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:45,620 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-11-12 15:41:45,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1237454464, now seen corresponding path program 1 times [2024-11-12 15:41:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:45,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299706447] [2024-11-12 15:41:45,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:45,624 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:45,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-12 15:41:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 15:41:46,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:46,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:46,500 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-12 15:41:46,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:41:46,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 15:41:46,525 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:41:46,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 15:41:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:46,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:46,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299706447] [2024-11-12 15:41:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299706447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:41:46,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165523565] [2024-11-12 15:41:46,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:46,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:41:46,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:46,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:41:46,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-12 15:41:46,540 INFO L87 Difference]: Start difference. First operand 1816 states and 2422 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:50,579 INFO L93 Difference]: Finished difference Result 2914 states and 3878 transitions. [2024-11-12 15:41:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 15:41:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-12 15:41:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:50,583 INFO L225 Difference]: With dead ends: 2914 [2024-11-12 15:41:50,583 INFO L226 Difference]: Without dead ends: 2914 [2024-11-12 15:41:50,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-12 15:41:50,584 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 1477 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 3379 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2022 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:50,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2841 Invalid, 5429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3379 Invalid, 0 Unknown, 2022 Unchecked, 4.0s Time] [2024-11-12 15:41:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-11-12 15:41:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1808. [2024-11-12 15:41:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1281 states have (on average 1.8212334113973458) internal successors, (2333), 1766 states have internal predecessors, (2333), 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-11-12 15:41:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2406 transitions. [2024-11-12 15:41:50,610 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2406 transitions. Word has length 74 [2024-11-12 15:41:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:50,610 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2406 transitions. [2024-11-12 15:41:50,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2406 transitions. [2024-11-12 15:41:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 15:41:50,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:50,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:50,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-12 15:41:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:50,812 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-11-12 15:41:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -948585261, now seen corresponding path program 1 times [2024-11-12 15:41:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180516804] [2024-11-12 15:41:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:50,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:50,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:50,814 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:50,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-12 15:41:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:51,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 15:41:51,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:51,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:41:51,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:41:51,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 15:41:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:51,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:51,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180516804] [2024-11-12 15:41:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180516804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 15:41:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346929516] [2024-11-12 15:41:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:41:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:41:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:41:51,239 INFO L87 Difference]: Start difference. First operand 1808 states and 2406 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:41:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:54,115 INFO L93 Difference]: Finished difference Result 1823 states and 2422 transitions. [2024-11-12 15:41:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:41:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-12 15:41:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:54,117 INFO L225 Difference]: With dead ends: 1823 [2024-11-12 15:41:54,117 INFO L226 Difference]: Without dead ends: 1823 [2024-11-12 15:41:54,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 15:41:54,118 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 16 mSDsluCounter, 3731 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:54,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4863 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 15:41:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-12 15:41:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1822. [2024-11-12 15:41:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8167053364269141) internal successors, (2349), 1778 states have internal predecessors, (2349), 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-11-12 15:41:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2422 transitions. [2024-11-12 15:41:54,142 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2422 transitions. Word has length 81 [2024-11-12 15:41:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:54,142 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2422 transitions. [2024-11-12 15:41:54,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:41:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2422 transitions. [2024-11-12 15:41:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 15:41:54,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:54,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:54,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-12 15:41:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:54,344 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-11-12 15:41:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 658628057, now seen corresponding path program 1 times [2024-11-12 15:41:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430850511] [2024-11-12 15:41:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:54,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:54,347 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:54,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-12 15:41:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:54,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 15:41:54,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:54,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:41:54,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:41:54,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 15:41:54,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 15:41:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:54,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:54,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430850511] [2024-11-12 15:41:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430850511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 15:41:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915152820] [2024-11-12 15:41:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 15:41:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:54,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 15:41:54,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 15:41:54,841 INFO L87 Difference]: Start difference. First operand 1822 states and 2422 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:58,473 INFO L93 Difference]: Finished difference Result 1822 states and 2420 transitions. [2024-11-12 15:41:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:41:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-12 15:41:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:58,476 INFO L225 Difference]: With dead ends: 1822 [2024-11-12 15:41:58,476 INFO L226 Difference]: Without dead ends: 1822 [2024-11-12 15:41:58,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 15:41:58,477 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 13 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5838 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:58,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5838 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-12 15:41:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2024-11-12 15:41:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2024-11-12 15:41:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1293 states have (on average 1.8151585460170148) internal successors, (2347), 1778 states have internal predecessors, (2347), 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-11-12 15:41:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2420 transitions. [2024-11-12 15:41:58,496 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2420 transitions. Word has length 82 [2024-11-12 15:41:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:58,497 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2420 transitions. [2024-11-12 15:41:58,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:41:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2420 transitions. [2024-11-12 15:41:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 15:41:58,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:58,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:58,508 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-11-12 15:41:58,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:58,699 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-11-12 15:41:58,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1486914519, now seen corresponding path program 1 times [2024-11-12 15:41:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103279284] [2024-11-12 15:41:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:58,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:58,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:58,703 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:58,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-12 15:41:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:59,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:41:59,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:59,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:41:59,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:59,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103279284] [2024-11-12 15:41:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103279284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:41:59,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:41:59,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:41:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585402995] [2024-11-12 15:41:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:41:59,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:41:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:41:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:59,128 INFO L87 Difference]: Start difference. First operand 1822 states and 2420 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 15:41:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:41:59,192 INFO L93 Difference]: Finished difference Result 1838 states and 2438 transitions. [2024-11-12 15:41:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:41:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-12 15:41:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:41:59,197 INFO L225 Difference]: With dead ends: 1838 [2024-11-12 15:41:59,197 INFO L226 Difference]: Without dead ends: 1832 [2024-11-12 15:41:59,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:41:59,198 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 3 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:41:59,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4532 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:41:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-12 15:41:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2024-11-12 15:41:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1301 states have (on average 1.8116833205226748) internal successors, (2357), 1788 states have internal predecessors, (2357), 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-11-12 15:41:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2432 transitions. [2024-11-12 15:41:59,220 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2432 transitions. Word has length 89 [2024-11-12 15:41:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:41:59,221 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2432 transitions. [2024-11-12 15:41:59,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 15:41:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2432 transitions. [2024-11-12 15:41:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 15:41:59,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:41:59,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:41:59,233 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 (23)] Forceful destruction successful, exit code 0 [2024-11-12 15:41:59,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:59,422 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-11-12 15:41:59,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:41:59,423 INFO L85 PathProgramCache]: Analyzing trace with hash 400224857, now seen corresponding path program 1 times [2024-11-12 15:41:59,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:41:59,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834819715] [2024-11-12 15:41:59,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:41:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:41:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:41:59,425 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:41:59,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-12 15:41:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:41:59,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:41:59,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:41:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:59,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:41:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:41:59,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:41:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834819715] [2024-11-12 15:41:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834819715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:41:59,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:41:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 15:41:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162182741] [2024-11-12 15:41:59,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:41:59,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 15:41:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:41:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 15:41:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 15:41:59,908 INFO L87 Difference]: Start difference. First operand 1832 states and 2432 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:00,062 INFO L93 Difference]: Finished difference Result 1858 states and 2462 transitions. [2024-11-12 15:42:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 15:42:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-12 15:42:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:00,066 INFO L225 Difference]: With dead ends: 1858 [2024-11-12 15:42:00,066 INFO L226 Difference]: Without dead ends: 1846 [2024-11-12 15:42:00,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-12 15:42:00,067 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 17 mSDsluCounter, 5660 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6797 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:00,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6797 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:42:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-12 15:42:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1840. [2024-11-12 15:42:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1309 states have (on average 1.8082505729564553) internal successors, (2367), 1796 states have internal predecessors, (2367), 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-11-12 15:42:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2442 transitions. [2024-11-12 15:42:00,087 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2442 transitions. Word has length 90 [2024-11-12 15:42:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:00,087 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2442 transitions. [2024-11-12 15:42:00,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2442 transitions. [2024-11-12 15:42:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 15:42:00,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:00,088 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:00,100 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 (24)] Forceful destruction successful, exit code 0 [2024-11-12 15:42:00,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:00,292 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-11-12 15:42:00,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1962339241, now seen corresponding path program 2 times [2024-11-12 15:42:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042951700] [2024-11-12 15:42:00,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:42:00,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:00,294 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:42:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-12 15:42:00,999 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:42:00,999 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:42:01,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 15:42:01,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:01,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:42:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:01,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042951700] [2024-11-12 15:42:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042951700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:42:01,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:42:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 15:42:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777179071] [2024-11-12 15:42:01,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:42:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 15:42:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 15:42:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-12 15:42:01,335 INFO L87 Difference]: Start difference. First operand 1840 states and 2442 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:01,882 INFO L93 Difference]: Finished difference Result 1876 states and 2492 transitions. [2024-11-12 15:42:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 15:42:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-12 15:42:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:01,886 INFO L225 Difference]: With dead ends: 1876 [2024-11-12 15:42:01,886 INFO L226 Difference]: Without dead ends: 1864 [2024-11-12 15:42:01,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-12 15:42:01,887 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 34 mSDsluCounter, 6798 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 7935 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:01,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 7935 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 15:42:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-12 15:42:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1858. [2024-11-12 15:42:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1327 states have (on average 1.8018085908063302) internal successors, (2391), 1814 states have internal predecessors, (2391), 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-11-12 15:42:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2466 transitions. [2024-11-12 15:42:01,909 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2466 transitions. Word has length 93 [2024-11-12 15:42:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:01,909 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2466 transitions. [2024-11-12 15:42:01,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2466 transitions. [2024-11-12 15:42:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 15:42:01,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:01,911 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:01,924 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-11-12 15:42:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:02,112 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-11-12 15:42:02,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash 860812567, now seen corresponding path program 3 times [2024-11-12 15:42:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683913675] [2024-11-12 15:42:02,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:42:02,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:02,117 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:42:02,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-12 15:42:03,119 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-12 15:42:03,119 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:42:03,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 15:42:03,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:03,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:42:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:03,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683913675] [2024-11-12 15:42:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683913675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:42:03,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:42:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-12 15:42:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333595794] [2024-11-12 15:42:03,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:42:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 15:42:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 15:42:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-12 15:42:03,883 INFO L87 Difference]: Start difference. First operand 1858 states and 2466 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:05,805 INFO L93 Difference]: Finished difference Result 1912 states and 2550 transitions. [2024-11-12 15:42:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-12 15:42:05,805 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-12 15:42:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:05,809 INFO L225 Difference]: With dead ends: 1912 [2024-11-12 15:42:05,809 INFO L226 Difference]: Without dead ends: 1894 [2024-11-12 15:42:05,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-12 15:42:05,811 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 79 mSDsluCounter, 13597 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 14734 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:05,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 14734 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 15:42:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2024-11-12 15:42:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2024-11-12 15:42:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1363 states have (on average 1.7879677182685254) internal successors, (2437), 1850 states have internal predecessors, (2437), 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-11-12 15:42:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2512 transitions. [2024-11-12 15:42:05,834 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2512 transitions. Word has length 99 [2024-11-12 15:42:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:05,834 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2512 transitions. [2024-11-12 15:42:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2512 transitions. [2024-11-12 15:42:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 15:42:05,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:05,835 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:05,852 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-11-12 15:42:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:06,037 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-11-12 15:42:06,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -451672425, now seen corresponding path program 4 times [2024-11-12 15:42:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:06,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133552824] [2024-11-12 15:42:06,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:42:06,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:06,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:06,042 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:42:06,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-12 15:42:06,823 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:42:06,823 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:42:06,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 15:42:06,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:07,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:42:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:42:08,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:42:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133552824] [2024-11-12 15:42:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133552824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:42:08,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:42:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 15:42:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743381031] [2024-11-12 15:42:08,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:42:08,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 15:42:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:42:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 15:42:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 15:42:08,691 INFO L87 Difference]: Start difference. First operand 1894 states and 2512 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:16,653 INFO L93 Difference]: Finished difference Result 1980 states and 2662 transitions. [2024-11-12 15:42:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-12 15:42:16,654 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-12 15:42:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:16,658 INFO L225 Difference]: With dead ends: 1980 [2024-11-12 15:42:16,658 INFO L226 Difference]: Without dead ends: 1968 [2024-11-12 15:42:16,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-12 15:42:16,661 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 96 mSDsluCounter, 29434 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 30571 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:16,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 30571 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:42:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-12 15:42:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1962. [2024-11-12 15:42:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1431 states have (on average 1.7672955974842768) internal successors, (2529), 1918 states have internal predecessors, (2529), 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-11-12 15:42:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2604 transitions. [2024-11-12 15:42:16,681 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2604 transitions. Word has length 111 [2024-11-12 15:42:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:16,682 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2604 transitions. [2024-11-12 15:42:16,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 15:42:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2604 transitions. [2024-11-12 15:42:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 15:42:16,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:16,683 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:16,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-12 15:42:16,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:16,884 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-11-12 15:42:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 508361047, now seen corresponding path program 5 times [2024-11-12 15:42:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:42:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256224691] [2024-11-12 15:42:16,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:42:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:42:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:42:16,887 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:42:16,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-12 15:42:18,197 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-12 15:42:18,197 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:42:18,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-12 15:42:18,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:18,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 15:42:18,355 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 15:42:18,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 15:42:18,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 15:42:18,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12