./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:32,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:32,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:47:32,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:32,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:32,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:32,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:32,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:32,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:32,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:32,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:32,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:32,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:32,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:32,612 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:32,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:32,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:32,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:32,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:32,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:32,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:32,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:32,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:32,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:32,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:32,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:32,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:32,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:32,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:32,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:32,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:32,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:32,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:32,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:32,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:32,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:32,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:47:32,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:47:32,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:32,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:32,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:32,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:32,623 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2024-10-13 11:47:32,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:32,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:32,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:32,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:32,931 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:32,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-10-13 11:47:34,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:34,926 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:34,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-10-13 11:47:34,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0abbb4bf/cfb5517254ab477ca0eb6fd5fd76fa6b/FLAG89e82f3a4 [2024-10-13 11:47:34,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0abbb4bf/cfb5517254ab477ca0eb6fd5fd76fa6b [2024-10-13 11:47:34,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:34,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:34,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:34,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:34,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:34,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:34" (1/1) ... [2024-10-13 11:47:34,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edf0021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:34, skipping insertion in model container [2024-10-13 11:47:34,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:34" (1/1) ... [2024-10-13 11:47:35,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:35,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:35,891 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:47:35,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b630005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:35, skipping insertion in model container [2024-10-13 11:47:35,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:35,893 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:47:35,896 INFO L158 Benchmark]: Toolchain (without parser) took 908.55ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 89.7MB in the beginning and 164.9MB in the end (delta: -75.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-10-13 11:47:35,897 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:47:35,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 905.52ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 89.3MB in the beginning and 164.9MB in the end (delta: -75.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-10-13 11:47:35,900 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.23ms. Allocated memory is still 151.0MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 905.52ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 89.3MB in the beginning and 164.9MB in the end (delta: -75.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:38,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:38,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:47:38,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:38,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:38,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:38,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:38,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:38,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:38,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:38,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:38,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:38,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:38,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:38,157 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:38,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:38,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:38,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:38,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:38,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:38,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:38,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:38,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:38,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:38,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:38,164 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:47:38,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:38,164 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:47:38,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:38,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:38,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:38,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:38,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:38,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:38,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:38,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:38,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:38,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:38,171 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:47:38,172 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:47:38,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:38,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:38,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:38,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:38,173 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:47:38,173 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2024-10-13 11:47:38,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:38,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:38,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:38,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:38,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:38,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-10-13 11:47:40,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:40,660 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:40,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2024-10-13 11:47:40,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc5e2d82/ee4b4c30a9774ca2a4eb88b9d3f9180a/FLAGb401414a9 [2024-10-13 11:47:40,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc5e2d82/ee4b4c30a9774ca2a4eb88b9d3f9180a [2024-10-13 11:47:40,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:40,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:40,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:40,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:40,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:40,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:40" (1/1) ... [2024-10-13 11:47:40,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a96c19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:40, skipping insertion in model container [2024-10-13 11:47:40,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:40" (1/1) ... [2024-10-13 11:47:40,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:41,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:41,598 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:47:41,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:41,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:41,800 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:47:41,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:41,978 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:47:41,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41 WrapperNode [2024-10-13 11:47:41,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:41,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:41,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:47:41,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:47:41,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,153 INFO L138 Inliner]: procedures = 180, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2895 [2024-10-13 11:47:42,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:42,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:47:42,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:47:42,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:47:42,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,281 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-13 11:47:42,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:47:42,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:47:42,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:47:42,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:47:42,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (1/1) ... [2024-10-13 11:47:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:42,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:47:42,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:47:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:47:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 11:47:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 11:47:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:47:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:47:42,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:47:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:47:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:47:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:47:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:47:42,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:47:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:42,529 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:47:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:47:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:47:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:47:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:47:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:47:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:47:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:47:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:47:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:47:42,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:47:42,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:47:42,786 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:47:42,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:47:42,842 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:42,887 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:42,916 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:47,892 INFO L? ?]: Removed 1373 outVars from TransFormulas that were not future-live. [2024-10-13 11:47:47,892 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:47:48,063 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:47:48,064 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-13 11:47:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:48 BoogieIcfgContainer [2024-10-13 11:47:48,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:47:48,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:47:48,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:47:48,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:47:48,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:47:40" (1/3) ... [2024-10-13 11:47:48,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7198cb50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:48, skipping insertion in model container [2024-10-13 11:47:48,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:41" (2/3) ... [2024-10-13 11:47:48,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7198cb50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:48, skipping insertion in model container [2024-10-13 11:47:48,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:48" (3/3) ... [2024-10-13 11:47:48,075 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2024-10-13 11:47:48,094 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:47:48,094 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-10-13 11:47:48,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:47:48,195 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;@5ba0a477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:47:48,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-10-13 11:47:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 1785 states, 855 states have (on average 2.201169590643275) internal successors, (1882), 1778 states have internal predecessors, (1882), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-13 11:47:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:47:48,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:48,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:47:48,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:47:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 169083, now seen corresponding path program 1 times [2024-10-13 11:47:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175770805] [2024-10-13 11:47:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:48,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:48,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:48,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:47:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:48,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:47:48,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:48,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:47:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:48,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:48,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175770805] [2024-10-13 11:47:48,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175770805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:48,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:48,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:47:48,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432889518] [2024-10-13 11:47:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:48,525 INFO L87 Difference]: Start difference. First operand has 1785 states, 855 states have (on average 2.201169590643275) internal successors, (1882), 1778 states have internal predecessors, (1882), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:50,668 INFO L93 Difference]: Finished difference Result 1771 states and 2818 transitions. [2024-10-13 11:47:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:47:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:50,701 INFO L225 Difference]: With dead ends: 1771 [2024-10-13 11:47:50,701 INFO L226 Difference]: Without dead ends: 1770 [2024-10-13 11:47:50,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:50,705 INFO L432 NwaCegarLoop]: 2419 mSDtfsCounter, 1704 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:50,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 2460 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:47:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-10-13 11:47:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2024-10-13 11:47:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 858 states have (on average 2.1083916083916083) internal successors, (1809), 1763 states have internal predecessors, (1809), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:47:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2817 transitions. [2024-10-13 11:47:51,022 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2817 transitions. Word has length 2 [2024-10-13 11:47:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:51,022 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2817 transitions. [2024-10-13 11:47:51,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2817 transitions. [2024-10-13 11:47:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:47:51,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:51,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:47:51,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:47:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:51,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:47:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 169084, now seen corresponding path program 1 times [2024-10-13 11:47:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:51,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496686539] [2024-10-13 11:47:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:51,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:51,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:51,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:51,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:47:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:51,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:47:51,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:51,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:47:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:51,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:51,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496686539] [2024-10-13 11:47:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496686539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:51,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:51,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:47:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134936932] [2024-10-13 11:47:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:51,382 INFO L87 Difference]: Start difference. First operand 1770 states and 2817 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:54,108 INFO L93 Difference]: Finished difference Result 2964 states and 5033 transitions. [2024-10-13 11:47:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:47:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:54,131 INFO L225 Difference]: With dead ends: 2964 [2024-10-13 11:47:54,132 INFO L226 Difference]: Without dead ends: 2964 [2024-10-13 11:47:54,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:54,133 INFO L432 NwaCegarLoop]: 2719 mSDtfsCounter, 1215 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:54,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 4605 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 11:47:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2024-10-13 11:47:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2876. [2024-10-13 11:47:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 1465 states have (on average 2.063481228668942) internal successors, (3023), 2869 states have internal predecessors, (3023), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 11:47:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5031 transitions. [2024-10-13 11:47:54,409 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5031 transitions. Word has length 2 [2024-10-13 11:47:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5031 transitions. [2024-10-13 11:47:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5031 transitions. [2024-10-13 11:47:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:47:54,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:54,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:47:54,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:47:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:54,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:47:54,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1533347461, now seen corresponding path program 1 times [2024-10-13 11:47:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:54,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111785872] [2024-10-13 11:47:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:54,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:54,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:47:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:54,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:47:54,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:54,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:47:54,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:47:54,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:47:54,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:47:54,835 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:47:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:47:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:54,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:54,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111785872] [2024-10-13 11:47:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111785872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810752668] [2024-10-13 11:47:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:54,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:47:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:47:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:47:54,865 INFO L87 Difference]: Start difference. First operand 2876 states and 5031 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:57,780 INFO L93 Difference]: Finished difference Result 2865 states and 5019 transitions. [2024-10-13 11:47:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:47:57,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:47:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:57,797 INFO L225 Difference]: With dead ends: 2865 [2024-10-13 11:47:57,798 INFO L226 Difference]: Without dead ends: 2865 [2024-10-13 11:47:57,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:47:57,801 INFO L432 NwaCegarLoop]: 2209 mSDtfsCounter, 1776 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:57,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 2239 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:47:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2024-10-13 11:47:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1758. [2024-10-13 11:47:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 858 states have (on average 2.093240093240093) internal successors, (1796), 1751 states have internal predecessors, (1796), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:47:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2804 transitions. [2024-10-13 11:47:58,117 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2804 transitions. Word has length 6 [2024-10-13 11:47:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2804 transitions. [2024-10-13 11:47:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2804 transitions. [2024-10-13 11:47:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:47:58,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:58,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:58,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:47:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:58,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:47:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 289131037, now seen corresponding path program 1 times [2024-10-13 11:47:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547301230] [2024-10-13 11:47:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:58,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:47:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:58,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:47:58,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:47:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:58,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:47:58,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:58,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:47:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:47:58,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:58,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547301230] [2024-10-13 11:47:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547301230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:58,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421183812] [2024-10-13 11:47:58,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:58,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:58,473 INFO L87 Difference]: Start difference. First operand 1758 states and 2804 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:01,028 INFO L93 Difference]: Finished difference Result 3018 states and 5092 transitions. [2024-10-13 11:48:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:48:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:01,047 INFO L225 Difference]: With dead ends: 3018 [2024-10-13 11:48:01,047 INFO L226 Difference]: Without dead ends: 3018 [2024-10-13 11:48:01,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:01,050 INFO L432 NwaCegarLoop]: 4625 mSDtfsCounter, 1452 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 6883 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:01,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 6883 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:48:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2024-10-13 11:48:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1775. [2024-10-13 11:48:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 885 states have (on average 2.094915254237288) internal successors, (1854), 1768 states have internal predecessors, (1854), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2862 transitions. [2024-10-13 11:48:01,294 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2862 transitions. Word has length 7 [2024-10-13 11:48:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2862 transitions. [2024-10-13 11:48:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2862 transitions. [2024-10-13 11:48:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:48:01,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:01,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:01,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:01,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:01,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 289131036, now seen corresponding path program 1 times [2024-10-13 11:48:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:01,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648914093] [2024-10-13 11:48:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:01,505 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:01,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 (6)] Waiting until timeout for monitored process [2024-10-13 11:48:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:01,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:01,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:01,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:48:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:01,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:01,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648914093] [2024-10-13 11:48:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648914093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:01,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534239663] [2024-10-13 11:48:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:01,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:01,675 INFO L87 Difference]: Start difference. First operand 1775 states and 2862 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:03,403 INFO L93 Difference]: Finished difference Result 2923 states and 5028 transitions. [2024-10-13 11:48:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:48:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:03,419 INFO L225 Difference]: With dead ends: 2923 [2024-10-13 11:48:03,419 INFO L226 Difference]: Without dead ends: 2923 [2024-10-13 11:48:03,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:03,420 INFO L432 NwaCegarLoop]: 4446 mSDtfsCounter, 1671 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 6576 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:03,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 6576 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:48:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2024-10-13 11:48:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1728. [2024-10-13 11:48:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 885 states have (on average 2.0372881355932204) internal successors, (1803), 1721 states have internal predecessors, (1803), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2811 transitions. [2024-10-13 11:48:03,660 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2811 transitions. Word has length 7 [2024-10-13 11:48:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2811 transitions. [2024-10-13 11:48:03,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2811 transitions. [2024-10-13 11:48:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 11:48:03,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:03,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:03,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:48:03,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:03,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -525639461, now seen corresponding path program 1 times [2024-10-13 11:48:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090950911] [2024-10-13 11:48:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:03,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:03,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:03,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:03,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:48:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:03,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:03,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:04,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:04,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:04,007 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 33 treesize of output 31 [2024-10-13 11:48:04,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:48:04,040 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 62 treesize of output 22 [2024-10-13 11:48:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:04,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:04,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090950911] [2024-10-13 11:48:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090950911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:04,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149530815] [2024-10-13 11:48:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:04,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:04,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:04,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:04,060 INFO L87 Difference]: Start difference. First operand 1728 states and 2811 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-10-13 11:48:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:06,588 INFO L93 Difference]: Finished difference Result 3439 states and 5607 transitions. [2024-10-13 11:48:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:06,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-10-13 11:48:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:06,603 INFO L225 Difference]: With dead ends: 3439 [2024-10-13 11:48:06,604 INFO L226 Difference]: Without dead ends: 3439 [2024-10-13 11:48:06,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:06,605 INFO L432 NwaCegarLoop]: 2858 mSDtfsCounter, 1713 mSDsluCounter, 4984 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 7842 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:06,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 7842 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:48:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2024-10-13 11:48:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 1730. [2024-10-13 11:48:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 887 states have (on average 2.0349492671927845) internal successors, (1805), 1723 states have internal predecessors, (1805), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2813 transitions. [2024-10-13 11:48:06,824 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2813 transitions. Word has length 9 [2024-10-13 11:48:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2813 transitions. [2024-10-13 11:48:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-10-13 11:48:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2813 transitions. [2024-10-13 11:48:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:48:06,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:06,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:06,832 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-10-13 11:48:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:07,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1738662029, now seen corresponding path program 1 times [2024-10-13 11:48:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730730556] [2024-10-13 11:48:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:07,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:07,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:07,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:07,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:48:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:07,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:48:07,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:07,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:07,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730730556] [2024-10-13 11:48:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730730556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134651367] [2024-10-13 11:48:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:07,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:07,184 INFO L87 Difference]: Start difference. First operand 1730 states and 2813 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:07,615 INFO L93 Difference]: Finished difference Result 1691 states and 2773 transitions. [2024-10-13 11:48:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:07,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:48:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:07,625 INFO L225 Difference]: With dead ends: 1691 [2024-10-13 11:48:07,625 INFO L226 Difference]: Without dead ends: 1691 [2024-10-13 11:48:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:07,626 INFO L432 NwaCegarLoop]: 2604 mSDtfsCounter, 61 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5166 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:07,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5166 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:48:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-13 11:48:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2024-10-13 11:48:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 872 states have (on average 2.0240825688073394) internal successors, (1765), 1684 states have internal predecessors, (1765), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2773 transitions. [2024-10-13 11:48:07,743 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2773 transitions. Word has length 15 [2024-10-13 11:48:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2773 transitions. [2024-10-13 11:48:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2773 transitions. [2024-10-13 11:48:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:48:07,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:07,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:07,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:48:07,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:07,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:07,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -111934483, now seen corresponding path program 1 times [2024-10-13 11:48:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148433234] [2024-10-13 11:48:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:07,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:07,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:07,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:07,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:48:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:08,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:08,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:08,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:08,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148433234] [2024-10-13 11:48:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148433234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:08,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:08,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237842592] [2024-10-13 11:48:08,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:08,115 INFO L87 Difference]: Start difference. First operand 1691 states and 2773 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:08,672 INFO L93 Difference]: Finished difference Result 1676 states and 2751 transitions. [2024-10-13 11:48:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 11:48:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:08,683 INFO L225 Difference]: With dead ends: 1676 [2024-10-13 11:48:08,683 INFO L226 Difference]: Without dead ends: 1676 [2024-10-13 11:48:08,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:08,684 INFO L432 NwaCegarLoop]: 2573 mSDtfsCounter, 45 mSDsluCounter, 5128 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7701 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:08,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7701 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-10-13 11:48:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1676. [2024-10-13 11:48:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 871 states have (on average 2.0011481056257177) internal successors, (1743), 1669 states have internal predecessors, (1743), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2751 transitions. [2024-10-13 11:48:08,795 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2751 transitions. Word has length 17 [2024-10-13 11:48:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:08,795 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2751 transitions. [2024-10-13 11:48:08,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2751 transitions. [2024-10-13 11:48:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:48:08,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:08,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:08,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:48:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:08,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1223605957, now seen corresponding path program 1 times [2024-10-13 11:48:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569397761] [2024-10-13 11:48:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:08,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:09,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:09,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:48:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:09,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:09,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:09,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:48:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:09,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:09,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:09,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569397761] [2024-10-13 11:48:09,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569397761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:09,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:09,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266846321] [2024-10-13 11:48:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:09,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:09,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:09,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:09,246 INFO L87 Difference]: Start difference. First operand 1676 states and 2751 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:12,253 INFO L93 Difference]: Finished difference Result 1676 states and 2751 transitions. [2024-10-13 11:48:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:48:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:12,260 INFO L225 Difference]: With dead ends: 1676 [2024-10-13 11:48:12,260 INFO L226 Difference]: Without dead ends: 1676 [2024-10-13 11:48:12,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:12,261 INFO L432 NwaCegarLoop]: 2308 mSDtfsCounter, 1613 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:12,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 3583 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 11:48:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-10-13 11:48:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1672. [2024-10-13 11:48:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 871 states have (on average 1.9965556831228473) internal successors, (1739), 1665 states have internal predecessors, (1739), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2747 transitions. [2024-10-13 11:48:12,370 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2747 transitions. Word has length 31 [2024-10-13 11:48:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:12,370 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2747 transitions. [2024-10-13 11:48:12,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2747 transitions. [2024-10-13 11:48:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:48:12,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:12,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:12,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:48:12,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:12,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1223605956, now seen corresponding path program 1 times [2024-10-13 11:48:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058525090] [2024-10-13 11:48:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:12,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:12,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:48:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:12,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:12,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:12,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:48:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:12,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:12,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058525090] [2024-10-13 11:48:12,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058525090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:12,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:12,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469729236] [2024-10-13 11:48:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:12,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:12,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:12,948 INFO L87 Difference]: Start difference. First operand 1672 states and 2747 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:16,663 INFO L93 Difference]: Finished difference Result 2915 states and 4977 transitions. [2024-10-13 11:48:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 11:48:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:16,674 INFO L225 Difference]: With dead ends: 2915 [2024-10-13 11:48:16,674 INFO L226 Difference]: Without dead ends: 2915 [2024-10-13 11:48:16,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:16,675 INFO L432 NwaCegarLoop]: 2458 mSDtfsCounter, 1390 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:16,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 5494 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 11:48:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2024-10-13 11:48:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1668. [2024-10-13 11:48:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 871 states have (on average 1.991963260619977) internal successors, (1735), 1661 states have internal predecessors, (1735), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2743 transitions. [2024-10-13 11:48:16,846 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2743 transitions. Word has length 31 [2024-10-13 11:48:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:16,846 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2743 transitions. [2024-10-13 11:48:16,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2743 transitions. [2024-10-13 11:48:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:48:16,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:16,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:16,856 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-10-13 11:48:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:17,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -472192075, now seen corresponding path program 1 times [2024-10-13 11:48:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116115507] [2024-10-13 11:48:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:17,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:17,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:17,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:48:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:17,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:17,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:17,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:17,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116115507] [2024-10-13 11:48:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116115507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385978444] [2024-10-13 11:48:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:17,310 INFO L87 Difference]: Start difference. First operand 1668 states and 2743 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:17,935 INFO L93 Difference]: Finished difference Result 1662 states and 2733 transitions. [2024-10-13 11:48:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-13 11:48:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:17,943 INFO L225 Difference]: With dead ends: 1662 [2024-10-13 11:48:17,944 INFO L226 Difference]: Without dead ends: 1662 [2024-10-13 11:48:17,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:17,945 INFO L432 NwaCegarLoop]: 2567 mSDtfsCounter, 15 mSDsluCounter, 5117 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7684 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:17,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7684 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-10-13 11:48:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2024-10-13 11:48:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 865 states have (on average 1.9942196531791907) internal successors, (1725), 1655 states have internal predecessors, (1725), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 11:48:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2733 transitions. [2024-10-13 11:48:18,068 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2733 transitions. Word has length 47 [2024-10-13 11:48:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:18,069 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2733 transitions. [2024-10-13 11:48:18,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2733 transitions. [2024-10-13 11:48:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:48:18,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:18,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:18,082 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:18,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:18,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:18,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1458955721, now seen corresponding path program 1 times [2024-10-13 11:48:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915243381] [2024-10-13 11:48:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:18,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:18,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:48:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:18,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:18,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:18,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:18,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915243381] [2024-10-13 11:48:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915243381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:48:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488733590] [2024-10-13 11:48:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:18,695 INFO L87 Difference]: Start difference. First operand 1662 states and 2733 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:19,275 INFO L93 Difference]: Finished difference Result 2833 states and 4917 transitions. [2024-10-13 11:48:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2024-10-13 11:48:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:19,285 INFO L225 Difference]: With dead ends: 2833 [2024-10-13 11:48:19,286 INFO L226 Difference]: Without dead ends: 2833 [2024-10-13 11:48:19,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:19,286 INFO L432 NwaCegarLoop]: 2702 mSDtfsCounter, 1136 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:19,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 5240 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2024-10-13 11:48:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2779. [2024-10-13 11:48:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 1482 states have (on average 1.960863697705803) internal successors, (2906), 2772 states have internal predecessors, (2906), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 11:48:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4914 transitions. [2024-10-13 11:48:19,476 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4914 transitions. Word has length 51 [2024-10-13 11:48:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:19,476 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 4914 transitions. [2024-10-13 11:48:19,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4914 transitions. [2024-10-13 11:48:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 11:48:19,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:19,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:19,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:19,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:19,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1211713131, now seen corresponding path program 1 times [2024-10-13 11:48:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:19,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084714000] [2024-10-13 11:48:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:19,680 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:19,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:48:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:20,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:48:20,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:20,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:48:20,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:48:20,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:48:20,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:48:20,484 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:48:20,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:48:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:20,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:20,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084714000] [2024-10-13 11:48:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084714000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:20,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827835795] [2024-10-13 11:48:20,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:20,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:20,500 INFO L87 Difference]: Start difference. First operand 2779 states and 4914 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:22,378 INFO L93 Difference]: Finished difference Result 2741 states and 4876 transitions. [2024-10-13 11:48:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-13 11:48:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:22,385 INFO L225 Difference]: With dead ends: 2741 [2024-10-13 11:48:22,385 INFO L226 Difference]: Without dead ends: 2741 [2024-10-13 11:48:22,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:22,385 INFO L432 NwaCegarLoop]: 2175 mSDtfsCounter, 1548 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 2191 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:48:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2024-10-13 11:48:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2714. [2024-10-13 11:48:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 1455 states have (on average 1.927147766323024) internal successors, (2804), 2707 states have internal predecessors, (2804), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 11:48:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 4812 transitions. [2024-10-13 11:48:22,580 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 4812 transitions. Word has length 54 [2024-10-13 11:48:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 4812 transitions. [2024-10-13 11:48:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4812 transitions. [2024-10-13 11:48:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:48:22,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:22,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:22,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:48:22,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:22,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:22,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2117360881, now seen corresponding path program 1 times [2024-10-13 11:48:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162521734] [2024-10-13 11:48:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:22,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:48:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:23,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:23,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:23,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:48:23,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:48:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:48:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:23,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:23,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162521734] [2024-10-13 11:48:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162521734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924349192] [2024-10-13 11:48:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:23,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:23,094 INFO L87 Difference]: Start difference. First operand 2714 states and 4812 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:24,572 INFO L93 Difference]: Finished difference Result 2713 states and 4811 transitions. [2024-10-13 11:48:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-13 11:48:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:24,583 INFO L225 Difference]: With dead ends: 2713 [2024-10-13 11:48:24,583 INFO L226 Difference]: Without dead ends: 2713 [2024-10-13 11:48:24,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:48:24,584 INFO L432 NwaCegarLoop]: 2541 mSDtfsCounter, 2 mSDsluCounter, 6885 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9426 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:24,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9426 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:48:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-10-13 11:48:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2713. [2024-10-13 11:48:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 1455 states have (on average 1.9264604810996564) internal successors, (2803), 2706 states have internal predecessors, (2803), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 11:48:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4811 transitions. [2024-10-13 11:48:24,780 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4811 transitions. Word has length 58 [2024-10-13 11:48:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 4811 transitions. [2024-10-13 11:48:24,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4811 transitions. [2024-10-13 11:48:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:48:24,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:24,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:24,792 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-10-13 11:48:24,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:24,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2117360882, now seen corresponding path program 1 times [2024-10-13 11:48:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961275496] [2024-10-13 11:48:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:24,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:24,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:24,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:48:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:25,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 11:48:25,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:48:25,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:48:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:48:25,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:48:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:25,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:25,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961275496] [2024-10-13 11:48:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961275496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914806073] [2024-10-13 11:48:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:25,338 INFO L87 Difference]: Start difference. First operand 2713 states and 4811 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:27,045 INFO L93 Difference]: Finished difference Result 2712 states and 4810 transitions. [2024-10-13 11:48:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-13 11:48:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:27,055 INFO L225 Difference]: With dead ends: 2712 [2024-10-13 11:48:27,055 INFO L226 Difference]: Without dead ends: 2712 [2024-10-13 11:48:27,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:48:27,056 INFO L432 NwaCegarLoop]: 2541 mSDtfsCounter, 1 mSDsluCounter, 6902 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9443 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:27,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9443 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:48:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-13 11:48:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2712. [2024-10-13 11:48:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 1454 states have (on average 1.9270976616231086) internal successors, (2802), 2705 states have internal predecessors, (2802), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 11:48:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 4810 transitions. [2024-10-13 11:48:27,318 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 4810 transitions. Word has length 58 [2024-10-13 11:48:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 2712 states and 4810 transitions. [2024-10-13 11:48:27,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 4810 transitions. [2024-10-13 11:48:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:48:27,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:27,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:27,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:27,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:27,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -506378379, now seen corresponding path program 1 times [2024-10-13 11:48:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011440115] [2024-10-13 11:48:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:27,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:27,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:27,524 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:27,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:48:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:27,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:27,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:27,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:27,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011440115] [2024-10-13 11:48:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011440115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:27,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162243732] [2024-10-13 11:48:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:27,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:27,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:27,774 INFO L87 Difference]: Start difference. First operand 2712 states and 4810 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:48:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:28,271 INFO L93 Difference]: Finished difference Result 2714 states and 4813 transitions. [2024-10-13 11:48:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:28,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-13 11:48:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:28,287 INFO L225 Difference]: With dead ends: 2714 [2024-10-13 11:48:28,288 INFO L226 Difference]: Without dead ends: 2714 [2024-10-13 11:48:28,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:28,289 INFO L432 NwaCegarLoop]: 2541 mSDtfsCounter, 0 mSDsluCounter, 5079 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7620 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:28,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7620 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2024-10-13 11:48:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2714. [2024-10-13 11:48:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 1455 states have (on average 1.927147766323024) internal successors, (2804), 2707 states have internal predecessors, (2804), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 11:48:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 4813 transitions. [2024-10-13 11:48:28,469 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 4813 transitions. Word has length 64 [2024-10-13 11:48:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:28,470 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 4813 transitions. [2024-10-13 11:48:28,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:48:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4813 transitions. [2024-10-13 11:48:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 11:48:28,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:28,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:28,480 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-10-13 11:48:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:28,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:28,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1391274133, now seen corresponding path program 1 times [2024-10-13 11:48:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230063178] [2024-10-13 11:48:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:28,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:28,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:28,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:48:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:28,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:28,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:28,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:29,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230063178] [2024-10-13 11:48:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230063178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:29,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:48:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055422685] [2024-10-13 11:48:29,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:48:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:48:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:48:29,071 INFO L87 Difference]: Start difference. First operand 2714 states and 4813 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:29,794 INFO L93 Difference]: Finished difference Result 2723 states and 4827 transitions. [2024-10-13 11:48:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:48:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-13 11:48:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:29,806 INFO L225 Difference]: With dead ends: 2723 [2024-10-13 11:48:29,806 INFO L226 Difference]: Without dead ends: 2723 [2024-10-13 11:48:29,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:48:29,807 INFO L432 NwaCegarLoop]: 2540 mSDtfsCounter, 4 mSDsluCounter, 5078 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7618 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:29,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7618 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:48:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2024-10-13 11:48:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2722. [2024-10-13 11:48:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 1462 states have (on average 1.926812585499316) internal successors, (2817), 2714 states have internal predecessors, (2817), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 11:48:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 4826 transitions. [2024-10-13 11:48:30,057 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 4826 transitions. Word has length 65 [2024-10-13 11:48:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 2722 states and 4826 transitions. [2024-10-13 11:48:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 4826 transitions. [2024-10-13 11:48:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 11:48:30,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:30,058 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 11:48:30,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:30,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:30,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1840289013, now seen corresponding path program 2 times [2024-10-13 11:48:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188500064] [2024-10-13 11:48:30,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:48:30,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:30,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:30,261 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:30,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:48:30,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:48:30,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:30,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:48:30,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:30,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:30,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188500064] [2024-10-13 11:48:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188500064] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:30,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:48:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099829681] [2024-10-13 11:48:30,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:48:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:48:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:48:30,919 INFO L87 Difference]: Start difference. First operand 2722 states and 4826 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:32,158 INFO L93 Difference]: Finished difference Result 2734 states and 4845 transitions. [2024-10-13 11:48:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:48:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-13 11:48:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:32,172 INFO L225 Difference]: With dead ends: 2734 [2024-10-13 11:48:32,172 INFO L226 Difference]: Without dead ends: 2732 [2024-10-13 11:48:32,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:48:32,177 INFO L432 NwaCegarLoop]: 2540 mSDtfsCounter, 8 mSDsluCounter, 15233 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17773 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:32,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17773 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:48:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2024-10-13 11:48:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2731. [2024-10-13 11:48:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 1471 states have (on average 1.9231815091774302) internal successors, (2829), 2723 states have internal predecessors, (2829), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 11:48:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 4838 transitions. [2024-10-13 11:48:32,543 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 4838 transitions. Word has length 68 [2024-10-13 11:48:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:32,543 INFO L471 AbstractCegarLoop]: Abstraction has 2731 states and 4838 transitions. [2024-10-13 11:48:32,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 4838 transitions. [2024-10-13 11:48:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 11:48:32,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:32,545 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:32,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 11:48:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:32,745 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -153853643, now seen corresponding path program 3 times [2024-10-13 11:48:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529781072] [2024-10-13 11:48:32,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:48:32,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:32,748 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:32,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:48:33,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:48:33,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:33,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:48:33,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:33,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:34,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529781072] [2024-10-13 11:48:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529781072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:34,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:48:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366060680] [2024-10-13 11:48:34,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:48:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:48:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:48:34,065 INFO L87 Difference]: Start difference. First operand 2731 states and 4838 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:37,328 INFO L93 Difference]: Finished difference Result 2752 states and 4874 transitions. [2024-10-13 11:48:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:48:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-13 11:48:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:37,336 INFO L225 Difference]: With dead ends: 2752 [2024-10-13 11:48:37,336 INFO L226 Difference]: Without dead ends: 2749 [2024-10-13 11:48:37,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:48:37,337 INFO L432 NwaCegarLoop]: 2540 mSDtfsCounter, 14 mSDsluCounter, 33002 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 35542 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:37,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 35542 Invalid, 1637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 11:48:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2024-10-13 11:48:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2024-10-13 11:48:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 1489 states have (on average 1.9153794492948288) internal successors, (2852), 2741 states have internal predecessors, (2852), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 11:48:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4861 transitions. [2024-10-13 11:48:37,555 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4861 transitions. Word has length 74 [2024-10-13 11:48:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 2749 states and 4861 transitions. [2024-10-13 11:48:37,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4861 transitions. [2024-10-13 11:48:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 11:48:37,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:37,556 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:37,567 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-10-13 11:48:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:37,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2129565259, now seen corresponding path program 4 times [2024-10-13 11:48:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003557231] [2024-10-13 11:48:37,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:48:37,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:37,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:37,762 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:37,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:48:38,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:48:38,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:38,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:48:38,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:38,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:39,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003557231] [2024-10-13 11:48:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003557231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:39,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:48:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463800954] [2024-10-13 11:48:39,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:39,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:48:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:48:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:48:39,838 INFO L87 Difference]: Start difference. First operand 2749 states and 4861 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:47,081 INFO L93 Difference]: Finished difference Result 2786 states and 4930 transitions. [2024-10-13 11:48:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:48:47,083 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-13 11:48:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:47,090 INFO L225 Difference]: With dead ends: 2786 [2024-10-13 11:48:47,090 INFO L226 Difference]: Without dead ends: 2784 [2024-10-13 11:48:47,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:48:47,092 INFO L432 NwaCegarLoop]: 2540 mSDtfsCounter, 25 mSDsluCounter, 60935 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63475 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:47,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63475 Invalid, 3778 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 3750 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 11:48:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-10-13 11:48:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2783. [2024-10-13 11:48:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 1523 states have (on average 1.902823374917925) internal successors, (2898), 2775 states have internal predecessors, (2898), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 11:48:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 4907 transitions. [2024-10-13 11:48:47,389 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 4907 transitions. Word has length 86 [2024-10-13 11:48:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:47,389 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 4907 transitions. [2024-10-13 11:48:47,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:48:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 4907 transitions. [2024-10-13 11:48:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 11:48:47,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:47,391 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:47,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 11:48:47,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:47,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-13 11:48:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1393712117, now seen corresponding path program 5 times [2024-10-13 11:48:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007669277] [2024-10-13 11:48:47,593 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:48:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:47,594 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:47,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 11:48:48,717 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:48:48,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:48,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 11:48:48,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:48:48,827 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 11:48:48,827 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-10-13 11:48:48,846 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-10-13 11:48:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 11:48:49,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:48:49,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-13 11:48:49,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-13 11:48:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:48:49,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:50,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1997) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-13 11:48:50,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007669277] [2024-10-13 11:48:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007669277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:48:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1553130933] [2024-10-13 11:48:50,165 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:48:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:48:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:48:50,166 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:48:50,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process