./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:56:46,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:56:46,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 20:56:46,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:56:46,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:56:46,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:56:46,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:56:46,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:56:46,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:56:46,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:56:46,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:56:46,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:56:46,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:56:46,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:56:46,453 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:56:46,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:56:46,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:56:46,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:56:46,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:56:46,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:56:46,458 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:56:46,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:56:46,458 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:56:46,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:56:46,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:56:46,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:56:46,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:56:46,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:56:46,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:56:46,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:56:46,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:56:46,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:56:46,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:56:46,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:56:46,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:56:46,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:56:46,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 20:56:46,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 20:56:46,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:56:46,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:56:46,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:56:46,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:56:46,463 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2024-11-22 20:56:46,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:56:46,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:56:46,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:56:46,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:56:46,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:56:46,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2024-11-22 20:56:48,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:56:48,285 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:56:48,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2024-11-22 20:56:48,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5a442de/80fd0708343e428f97dc89150ddee21e/FLAG8c42084a3 [2024-11-22 20:56:48,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5a442de/80fd0708343e428f97dc89150ddee21e [2024-11-22 20:56:48,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:56:48,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:56:48,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:48,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:56:48,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:56:48,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:48" (1/1) ... [2024-11-22 20:56:48,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e31a707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:48, skipping insertion in model container [2024-11-22 20:56:48,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:48" (1/1) ... [2024-11-22 20:56:48,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:56:49,053 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,082 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,087 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,090 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,099 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,136 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,147 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,173 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,175 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,177 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,187 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,188 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,192 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:49,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:56:49,208 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 20:56:49,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d2022e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:49, skipping insertion in model container [2024-11-22 20:56:49,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:49,210 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 20:56:49,211 INFO L158 Benchmark]: Toolchain (without parser) took 608.28ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 119.1MB in the end (delta: -29.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-22 20:56:49,212 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 20:56:49,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.25ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 119.1MB in the end (delta: -29.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-22 20:56:49,213 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.15ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.25ms. Allocated memory is still 163.6MB. Free memory was 89.8MB in the beginning and 119.1MB in the end (delta: -29.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:56:51,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:56:51,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 20:56:51,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:56:51,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:56:51,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:56:51,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:56:51,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:56:51,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:56:51,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:56:51,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:56:51,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:56:51,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:56:51,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:56:51,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:56:51,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:56:51,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:56:51,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:56:51,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:56:51,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:56:51,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:56:51,198 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:56:51,198 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:56:51,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:56:51,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:56:51,199 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 20:56:51,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:56:51,199 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 20:56:51,200 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:56:51,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:56:51,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:56:51,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:56:51,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:56:51,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:56:51,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:56:51,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:56:51,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:56:51,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:56:51,201 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 20:56:51,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 20:56:51,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:56:51,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:56:51,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:56:51,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:56:51,204 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2024-11-22 20:56:51,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:56:51,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:56:51,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:56:51,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:56:51,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:56:51,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2024-11-22 20:56:52,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:56:53,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:56:53,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2024-11-22 20:56:53,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/061ba08c6/f5f61f64869943e38474ea0cd1b23a4f/FLAG0abe6bec6 [2024-11-22 20:56:53,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/061ba08c6/f5f61f64869943e38474ea0cd1b23a4f [2024-11-22 20:56:53,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:56:53,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:56:53,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:53,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:56:53,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:56:53,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:53" (1/1) ... [2024-11-22 20:56:53,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667a9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:53, skipping insertion in model container [2024-11-22 20:56:53,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:56:53" (1/1) ... [2024-11-22 20:56:53,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:56:53,802 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,835 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,838 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,843 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,852 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,884 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,886 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,890 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,895 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,923 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,924 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,925 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,927 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,931 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,935 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,938 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:53,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:56:53,958 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 20:56:53,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:56:53,993 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,010 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,012 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,013 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,018 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,027 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,028 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,029 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,031 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,039 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,039 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,040 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,040 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,042 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,045 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:56:54,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:56:54,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 20:56:54,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:56:54,182 INFO L204 MainTranslator]: Completed translation [2024-11-22 20:56:54,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54 WrapperNode [2024-11-22 20:56:54,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:56:54,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 20:56:54,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 20:56:54,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 20:56:54,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,291 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1759 [2024-11-22 20:56:54,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 20:56:54,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 20:56:54,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 20:56:54,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 20:56:54,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,489 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2024-11-22 20:56:54,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 20:56:54,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 20:56:54,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 20:56:54,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 20:56:54,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (1/1) ... [2024-11-22 20:56:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:56:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:56:54,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 20:56:54,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 20:56:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 20:56:54,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 20:56:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 20:56:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 20:56:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 20:56:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 20:56:54,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 20:56:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 20:56:54,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 20:56:54,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 20:56:54,620 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 20:56:54,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 20:56:54,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 20:56:54,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 20:56:54,870 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 20:56:54,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 20:56:54,891 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:56:54,924 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:56:54,942 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:56:59,754 INFO L? ?]: Removed 1907 outVars from TransFormulas that were not future-live. [2024-11-22 20:56:59,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 20:56:59,784 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 20:56:59,785 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-22 20:56:59,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:56:59 BoogieIcfgContainer [2024-11-22 20:56:59,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 20:56:59,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 20:56:59,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 20:56:59,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 20:56:59,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:56:53" (1/3) ... [2024-11-22 20:56:59,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36487254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:56:59, skipping insertion in model container [2024-11-22 20:56:59,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:56:54" (2/3) ... [2024-11-22 20:56:59,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36487254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:56:59, skipping insertion in model container [2024-11-22 20:56:59,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:56:59" (3/3) ... [2024-11-22 20:56:59,793 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2024-11-22 20:56:59,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 20:56:59,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 915 error locations. [2024-11-22 20:56:59,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 20:56:59,861 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;@28467e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 20:56:59,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-22 20:56:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 1824 states, 898 states have (on average 2.2371937639198216) internal successors, (2009), 1814 states have internal predecessors, (2009), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 20:56:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 20:56:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:56:59,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 20:56:59,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:56:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:56:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-22 20:56:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:56:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875418525] [2024-11-22 20:56:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:56:59,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:56:59,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:56:59,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:56:59,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 20:57:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:00,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 20:57:00,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:00,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:00,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875418525] [2024-11-22 20:57:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875418525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:57:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948239387] [2024-11-22 20:57:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:00,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 20:57:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:00,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 20:57:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 20:57:00,074 INFO L87 Difference]: Start difference. First operand has 1824 states, 898 states have (on average 2.2371937639198216) internal successors, (2009), 1814 states have internal predecessors, (2009), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:00,204 INFO L93 Difference]: Finished difference Result 1804 states and 1905 transitions. [2024-11-22 20:57:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 20:57:00,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-22 20:57:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:00,258 INFO L225 Difference]: With dead ends: 1804 [2024-11-22 20:57:00,259 INFO L226 Difference]: Without dead ends: 1802 [2024-11-22 20:57:00,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 20:57:00,266 INFO L432 NwaCegarLoop]: 1905 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:00,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-22 20:57:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-22 20:57:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 888 states have (on average 2.115990990990991) internal successors, (1879), 1792 states have internal predecessors, (1879), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 1903 transitions. [2024-11-22 20:57:00,417 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 1903 transitions. Word has length 5 [2024-11-22 20:57:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:00,420 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 1903 transitions. [2024-11-22 20:57:00,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 1903 transitions. [2024-11-22 20:57:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 20:57:00,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:00,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 20:57:00,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 20:57:00,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:00,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:00,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-22 20:57:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603431966] [2024-11-22 20:57:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:00,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:00,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 20:57:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:00,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:00,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:00,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:57:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:00,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:00,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603431966] [2024-11-22 20:57:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603431966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:57:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221276648] [2024-11-22 20:57:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:00,812 INFO L87 Difference]: Start difference. First operand 1802 states and 1903 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:03,034 INFO L93 Difference]: Finished difference Result 1938 states and 2071 transitions. [2024-11-22 20:57:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-22 20:57:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:03,049 INFO L225 Difference]: With dead ends: 1938 [2024-11-22 20:57:03,049 INFO L226 Difference]: Without dead ends: 1938 [2024-11-22 20:57:03,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:03,050 INFO L432 NwaCegarLoop]: 1368 mSDtfsCounter, 1264 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:03,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1742 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 20:57:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2024-11-22 20:57:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1710. [2024-11-22 20:57:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 888 states have (on average 2.0123873873873874) internal successors, (1787), 1700 states have internal predecessors, (1787), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 1811 transitions. [2024-11-22 20:57:03,132 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 1811 transitions. Word has length 5 [2024-11-22 20:57:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:03,132 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 1811 transitions. [2024-11-22 20:57:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 1811 transitions. [2024-11-22 20:57:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 20:57:03,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:03,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 20:57:03,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 20:57:03,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:03,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-22 20:57:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139943390] [2024-11-22 20:57:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:03,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:03,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:03,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 20:57:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:03,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:57:03,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:03,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 20:57:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:03,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:03,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:03,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139943390] [2024-11-22 20:57:03,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139943390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:03,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:03,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:57:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734254291] [2024-11-22 20:57:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:03,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:03,484 INFO L87 Difference]: Start difference. First operand 1710 states and 1811 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:06,191 INFO L93 Difference]: Finished difference Result 2256 states and 2408 transitions. [2024-11-22 20:57:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-22 20:57:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:06,197 INFO L225 Difference]: With dead ends: 2256 [2024-11-22 20:57:06,198 INFO L226 Difference]: Without dead ends: 2256 [2024-11-22 20:57:06,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:06,199 INFO L432 NwaCegarLoop]: 1732 mSDtfsCounter, 768 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:06,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2539 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-22 20:57:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-11-22 20:57:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1877. [2024-11-22 20:57:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1065 states have (on average 1.9784037558685446) internal successors, (2107), 1867 states have internal predecessors, (2107), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2131 transitions. [2024-11-22 20:57:06,222 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2131 transitions. Word has length 5 [2024-11-22 20:57:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2131 transitions. [2024-11-22 20:57:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2131 transitions. [2024-11-22 20:57:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 20:57:06,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:06,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 20:57:06,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 20:57:06,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:06,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1956327503, now seen corresponding path program 1 times [2024-11-22 20:57:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258058700] [2024-11-22 20:57:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:06,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:06,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:06,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:06,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 20:57:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:06,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:57:06,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:06,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:06,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:06,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258058700] [2024-11-22 20:57:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258058700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:06,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513126866] [2024-11-22 20:57:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:06,547 INFO L87 Difference]: Start difference. First operand 1877 states and 2131 transitions. Second operand has 3 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-11-22 20:57:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:06,646 INFO L93 Difference]: Finished difference Result 3354 states and 3843 transitions. [2024-11-22 20:57:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-22 20:57:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:06,658 INFO L225 Difference]: With dead ends: 3354 [2024-11-22 20:57:06,659 INFO L226 Difference]: Without dead ends: 3354 [2024-11-22 20:57:06,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:06,661 INFO L432 NwaCegarLoop]: 1797 mSDtfsCounter, 1357 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:06,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2024-11-22 20:57:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 1879. [2024-11-22 20:57:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1067 states have (on average 1.9765698219306467) internal successors, (2109), 1869 states have internal predecessors, (2109), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2133 transitions. [2024-11-22 20:57:06,704 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2133 transitions. Word has length 6 [2024-11-22 20:57:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:06,704 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2133 transitions. [2024-11-22 20:57:06,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-22 20:57:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2133 transitions. [2024-11-22 20:57:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 20:57:06,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:06,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:06,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 20:57:06,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:06,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:06,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:06,909 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-22 20:57:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40630598] [2024-11-22 20:57:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:06,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:06,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:06,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 20:57:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:07,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:57:07,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:07,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:07,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40630598] [2024-11-22 20:57:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40630598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:07,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:07,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991308322] [2024-11-22 20:57:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:07,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:07,061 INFO L87 Difference]: Start difference. First operand 1879 states and 2133 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:07,100 INFO L93 Difference]: Finished difference Result 1837 states and 2090 transitions. [2024-11-22 20:57:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:07,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-22 20:57:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:07,104 INFO L225 Difference]: With dead ends: 1837 [2024-11-22 20:57:07,105 INFO L226 Difference]: Without dead ends: 1837 [2024-11-22 20:57:07,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:07,105 INFO L432 NwaCegarLoop]: 1746 mSDtfsCounter, 71 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:07,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3429 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-11-22 20:57:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2024-11-22 20:57:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1049 states have (on average 1.9694947569113441) internal successors, (2066), 1827 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2090 transitions. [2024-11-22 20:57:07,125 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2090 transitions. Word has length 11 [2024-11-22 20:57:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:07,126 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2090 transitions. [2024-11-22 20:57:07,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2090 transitions. [2024-11-22 20:57:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 20:57:07,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:07,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:07,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 20:57:07,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1407004526, now seen corresponding path program 1 times [2024-11-22 20:57:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:07,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968403836] [2024-11-22 20:57:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:07,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:07,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 20:57:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:07,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:07,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:07,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:07,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968403836] [2024-11-22 20:57:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968403836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478160992] [2024-11-22 20:57:07,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:07,522 INFO L87 Difference]: Start difference. First operand 1837 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:07,634 INFO L93 Difference]: Finished difference Result 1815 states and 2061 transitions. [2024-11-22 20:57:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 20:57:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:07,640 INFO L225 Difference]: With dead ends: 1815 [2024-11-22 20:57:07,640 INFO L226 Difference]: Without dead ends: 1815 [2024-11-22 20:57:07,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:07,643 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 48 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:07,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5077 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-22 20:57:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1815. [2024-11-22 20:57:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1041 states have (on average 1.956772334293948) internal successors, (2037), 1805 states have internal predecessors, (2037), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2061 transitions. [2024-11-22 20:57:07,665 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2061 transitions. Word has length 13 [2024-11-22 20:57:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2061 transitions. [2024-11-22 20:57:07,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2061 transitions. [2024-11-22 20:57:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 20:57:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:07,668 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] [2024-11-22 20:57:07,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 20:57:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507840, now seen corresponding path program 1 times [2024-11-22 20:57:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291766820] [2024-11-22 20:57:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:07,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:07,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:07,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:07,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 20:57:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:08,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:57:08,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:08,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:57:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:08,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:08,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291766820] [2024-11-22 20:57:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291766820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:08,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869193899] [2024-11-22 20:57:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:08,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:08,077 INFO L87 Difference]: Start difference. First operand 1815 states and 2061 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:10,243 INFO L93 Difference]: Finished difference Result 1815 states and 2061 transitions. [2024-11-22 20:57:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:10,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 20:57:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:10,248 INFO L225 Difference]: With dead ends: 1815 [2024-11-22 20:57:10,248 INFO L226 Difference]: Without dead ends: 1815 [2024-11-22 20:57:10,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:10,249 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 1201 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:10,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2080 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 20:57:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-22 20:57:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1811. [2024-11-22 20:57:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1041 states have (on average 1.9529298751200768) internal successors, (2033), 1801 states have internal predecessors, (2033), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2057 transitions. [2024-11-22 20:57:10,268 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2057 transitions. Word has length 27 [2024-11-22 20:57:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:10,269 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2057 transitions. [2024-11-22 20:57:10,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2057 transitions. [2024-11-22 20:57:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 20:57:10,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:10,270 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] [2024-11-22 20:57:10,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 20:57:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:10,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1466507841, now seen corresponding path program 1 times [2024-11-22 20:57:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909209233] [2024-11-22 20:57:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:10,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:10,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 20:57:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:10,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:57:10,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:10,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 20:57:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:10,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:10,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909209233] [2024-11-22 20:57:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909209233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845613993] [2024-11-22 20:57:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:10,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:10,766 INFO L87 Difference]: Start difference. First operand 1811 states and 2057 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:13,593 INFO L93 Difference]: Finished difference Result 2191 states and 2335 transitions. [2024-11-22 20:57:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-22 20:57:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:13,599 INFO L225 Difference]: With dead ends: 2191 [2024-11-22 20:57:13,599 INFO L226 Difference]: Without dead ends: 2191 [2024-11-22 20:57:13,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:13,599 INFO L432 NwaCegarLoop]: 1430 mSDtfsCounter, 701 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:13,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 3067 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-22 20:57:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2024-11-22 20:57:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1807. [2024-11-22 20:57:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1041 states have (on average 1.9490874159462055) internal successors, (2029), 1797 states have internal predecessors, (2029), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2053 transitions. [2024-11-22 20:57:13,635 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2053 transitions. Word has length 27 [2024-11-22 20:57:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:13,636 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2053 transitions. [2024-11-22 20:57:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2053 transitions. [2024-11-22 20:57:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 20:57:13,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:13,637 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] [2024-11-22 20:57:13,642 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:13,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:13,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:13,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 240316858, now seen corresponding path program 1 times [2024-11-22 20:57:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215931343] [2024-11-22 20:57:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:13,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:13,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:13,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 20:57:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:14,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:14,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:14,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:14,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215931343] [2024-11-22 20:57:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215931343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843401160] [2024-11-22 20:57:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:14,077 INFO L87 Difference]: Start difference. First operand 1807 states and 2053 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:14,124 INFO L93 Difference]: Finished difference Result 1801 states and 2043 transitions. [2024-11-22 20:57:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:57:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-11-22 20:57:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:14,128 INFO L225 Difference]: With dead ends: 1801 [2024-11-22 20:57:14,128 INFO L226 Difference]: Without dead ends: 1801 [2024-11-22 20:57:14,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:14,129 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 21 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:14,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5054 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-22 20:57:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2024-11-22 20:57:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1035 states have (on average 1.9507246376811593) internal successors, (2019), 1791 states have internal predecessors, (2019), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2043 transitions. [2024-11-22 20:57:14,171 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2043 transitions. Word has length 43 [2024-11-22 20:57:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:14,171 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2043 transitions. [2024-11-22 20:57:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2043 transitions. [2024-11-22 20:57:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 20:57:14,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:14,173 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-11-22 20:57:14,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:14,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1088353786, now seen corresponding path program 1 times [2024-11-22 20:57:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285945189] [2024-11-22 20:57:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:14,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:14,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:14,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 20:57:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:14,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:14,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:14,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:14,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285945189] [2024-11-22 20:57:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285945189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:14,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:14,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867973483] [2024-11-22 20:57:14,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:14,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:57:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:57:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:57:14,717 INFO L87 Difference]: Start difference. First operand 1801 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-11-22 20:57:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:14,851 INFO L93 Difference]: Finished difference Result 2199 states and 2478 transitions. [2024-11-22 20:57:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:57:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-11-22 20:57:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:14,856 INFO L225 Difference]: With dead ends: 2199 [2024-11-22 20:57:14,856 INFO L226 Difference]: Without dead ends: 2199 [2024-11-22 20:57:14,857 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-11-22 20:57:14,857 INFO L432 NwaCegarLoop]: 1781 mSDtfsCounter, 366 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:14,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 3425 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2024-11-22 20:57:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1848. [2024-11-22 20:57:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1082 states have (on average 1.9094269870609981) internal successors, (2066), 1838 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2090 transitions. [2024-11-22 20:57:14,886 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2090 transitions. Word has length 51 [2024-11-22 20:57:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:14,886 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2090 transitions. [2024-11-22 20:57:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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-11-22 20:57:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2090 transitions. [2024-11-22 20:57:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 20:57:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:14,887 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-11-22 20:57:14,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-22 20:57:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:15,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:15,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -546976181, now seen corresponding path program 1 times [2024-11-22 20:57:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969138869] [2024-11-22 20:57:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:15,095 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:15,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 20:57:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:15,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:57:15,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:15,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:57:15,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 20:57:15,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:57:15,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 20:57:15,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:57:15,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 20:57:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:15,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:15,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969138869] [2024-11-22 20:57:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969138869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:57:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332194822] [2024-11-22 20:57:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:15,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:15,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:15,740 INFO L87 Difference]: Start difference. First operand 1848 states and 2090 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-11-22 20:57:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:17,766 INFO L93 Difference]: Finished difference Result 1764 states and 2006 transitions. [2024-11-22 20:57:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:17,766 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-11-22 20:57:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:17,770 INFO L225 Difference]: With dead ends: 1764 [2024-11-22 20:57:17,771 INFO L226 Difference]: Without dead ends: 1764 [2024-11-22 20:57:17,771 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-11-22 20:57:17,771 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 2256 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:17,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 1040 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 20:57:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-22 20:57:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1587. [2024-11-22 20:57:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 905 states have (on average 1.825414364640884) internal successors, (1652), 1577 states have internal predecessors, (1652), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 1676 transitions. [2024-11-22 20:57:17,806 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 1676 transitions. Word has length 54 [2024-11-22 20:57:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:17,806 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 1676 transitions. [2024-11-22 20:57:17,806 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-11-22 20:57:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1676 transitions. [2024-11-22 20:57:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 20:57:17,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:17,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:17,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-22 20:57:18,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:18,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:18,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 206433881, now seen corresponding path program 1 times [2024-11-22 20:57:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121908759] [2024-11-22 20:57:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:18,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:18,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:18,012 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 20:57:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:18,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:57:18,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:18,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:57:18,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:57:18,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 20:57:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:18,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:18,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121908759] [2024-11-22 20:57:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121908759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:18,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036305832] [2024-11-22 20:57:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:57:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:57:18,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:18,292 INFO L87 Difference]: Start difference. First operand 1587 states and 1676 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:20,841 INFO L93 Difference]: Finished difference Result 1586 states and 1675 transitions. [2024-11-22 20:57:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:57:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-22 20:57:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:20,844 INFO L225 Difference]: With dead ends: 1586 [2024-11-22 20:57:20,844 INFO L226 Difference]: Without dead ends: 1586 [2024-11-22 20:57:20,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:20,845 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 2 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:20,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4171 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 20:57:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-22 20:57:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2024-11-22 20:57:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 905 states have (on average 1.8243093922651934) internal successors, (1651), 1576 states have internal predecessors, (1651), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1675 transitions. [2024-11-22 20:57:20,858 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1675 transitions. Word has length 59 [2024-11-22 20:57:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:20,859 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 1675 transitions. [2024-11-22 20:57:20,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1675 transitions. [2024-11-22 20:57:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 20:57:20,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:20,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:20,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-22 20:57:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 206433882, now seen corresponding path program 1 times [2024-11-22 20:57:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000938361] [2024-11-22 20:57:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:21,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:21,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 20:57:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:21,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 20:57:21,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:21,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 20:57:21,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 20:57:21,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:57:21,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-22 20:57:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:21,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:21,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000938361] [2024-11-22 20:57:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000938361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:21,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:21,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287332183] [2024-11-22 20:57:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:21,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:57:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:57:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:57:21,379 INFO L87 Difference]: Start difference. First operand 1586 states and 1675 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:24,315 INFO L93 Difference]: Finished difference Result 1585 states and 1674 transitions. [2024-11-22 20:57:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:57:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-22 20:57:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:24,324 INFO L225 Difference]: With dead ends: 1585 [2024-11-22 20:57:24,324 INFO L226 Difference]: Without dead ends: 1585 [2024-11-22 20:57:24,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:57:24,325 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 1 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:24,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4221 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 20:57:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-22 20:57:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2024-11-22 20:57:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 904 states have (on average 1.825221238938053) internal successors, (1650), 1575 states have internal predecessors, (1650), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 20:57:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1674 transitions. [2024-11-22 20:57:24,355 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1674 transitions. Word has length 59 [2024-11-22 20:57:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:24,355 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 1674 transitions. [2024-11-22 20:57:24,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:57:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1674 transitions. [2024-11-22 20:57:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 20:57:24,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:24,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:24,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:24,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:24,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 199394880, now seen corresponding path program 1 times [2024-11-22 20:57:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549783124] [2024-11-22 20:57:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:24,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:24,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:24,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:24,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 20:57:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:24,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:57:24,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:24,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:57:24,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:24,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549783124] [2024-11-22 20:57:24,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549783124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:57:24,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:57:24,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:57:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204386337] [2024-11-22 20:57:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:57:24,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:57:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:57:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:57:24,815 INFO L87 Difference]: Start difference. First operand 1585 states and 1674 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:57:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:24,859 INFO L93 Difference]: Finished difference Result 1588 states and 1679 transitions. [2024-11-22 20:57:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:57:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-22 20:57:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:24,864 INFO L225 Difference]: With dead ends: 1588 [2024-11-22 20:57:24,864 INFO L226 Difference]: Without dead ends: 1588 [2024-11-22 20:57:24,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-11-22 20:57:24,864 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 0 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:24,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:57:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-22 20:57:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2024-11-22 20:57:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 906 states have (on average 1.8245033112582782) internal successors, (1653), 1578 states have internal predecessors, (1653), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 20:57:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1679 transitions. [2024-11-22 20:57:24,880 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1679 transitions. Word has length 67 [2024-11-22 20:57:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:24,880 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 1679 transitions. [2024-11-22 20:57:24,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:57:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1679 transitions. [2024-11-22 20:57:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 20:57:24,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:24,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:24,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 20:57:25,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:25,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:25,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1880790512, now seen corresponding path program 1 times [2024-11-22 20:57:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:25,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372188731] [2024-11-22 20:57:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:57:25,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:25,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:25,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:25,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 20:57:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:57:25,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:57:25,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:25,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:25,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372188731] [2024-11-22 20:57:25,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372188731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:25,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:25,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 20:57:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519072925] [2024-11-22 20:57:25,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 20:57:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:25,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 20:57:25,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 20:57:25,389 INFO L87 Difference]: Start difference. First operand 1588 states and 1679 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-11-22 20:57:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:25,513 INFO L93 Difference]: Finished difference Result 1600 states and 1697 transitions. [2024-11-22 20:57:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:57:25,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-11-22 20:57:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:25,516 INFO L225 Difference]: With dead ends: 1600 [2024-11-22 20:57:25,516 INFO L226 Difference]: Without dead ends: 1600 [2024-11-22 20:57:25,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 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-11-22 20:57:25,517 INFO L432 NwaCegarLoop]: 1620 mSDtfsCounter, 5 mSDsluCounter, 6459 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8079 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:25,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8079 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:57:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-22 20:57:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1598. [2024-11-22 20:57:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 915 states have (on average 1.8229508196721311) internal successors, (1668), 1587 states have internal predecessors, (1668), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 20:57:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1694 transitions. [2024-11-22 20:57:25,530 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1694 transitions. Word has length 68 [2024-11-22 20:57:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:25,530 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 1694 transitions. [2024-11-22 20:57:25,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-11-22 20:57:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1694 transitions. [2024-11-22 20:57:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 20:57:25,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:25,531 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:25,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 20:57:25,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:25,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:25,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1631646272, now seen corresponding path program 2 times [2024-11-22 20:57:25,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:25,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637496466] [2024-11-22 20:57:25,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 20:57:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:25,739 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:25,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 20:57:26,151 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 20:57:26,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:26,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:57:26,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:26,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:26,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637496466] [2024-11-22 20:57:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637496466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:26,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 20:57:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872453930] [2024-11-22 20:57:26,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:26,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 20:57:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 20:57:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 20:57:26,358 INFO L87 Difference]: Start difference. First operand 1598 states and 1694 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-11-22 20:57:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:26,750 INFO L93 Difference]: Finished difference Result 1613 states and 1715 transitions. [2024-11-22 20:57:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 20:57:26,755 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 71 [2024-11-22 20:57:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:26,759 INFO L225 Difference]: With dead ends: 1613 [2024-11-22 20:57:26,759 INFO L226 Difference]: Without dead ends: 1607 [2024-11-22 20:57:26,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 20:57:26,760 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 12 mSDsluCounter, 8085 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9706 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:26,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9706 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:57:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-22 20:57:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-22 20:57:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 924 states have (on average 1.817099567099567) internal successors, (1679), 1596 states have internal predecessors, (1679), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 20:57:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1705 transitions. [2024-11-22 20:57:26,779 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1705 transitions. Word has length 71 [2024-11-22 20:57:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:26,779 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 1705 transitions. [2024-11-22 20:57:26,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-11-22 20:57:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1705 transitions. [2024-11-22 20:57:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 20:57:26,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:26,782 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:26,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 20:57:26,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:26,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:26,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2110434240, now seen corresponding path program 3 times [2024-11-22 20:57:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466729771] [2024-11-22 20:57:26,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 20:57:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:26,985 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:26,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 20:57:27,522 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 20:57:27,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:27,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 20:57:27,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:27,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:28,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466729771] [2024-11-22 20:57:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466729771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:28,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 20:57:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530678388] [2024-11-22 20:57:28,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 20:57:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 20:57:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 20:57:28,056 INFO L87 Difference]: Start difference. First operand 1607 states and 1705 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-11-22 20:57:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:29,344 INFO L93 Difference]: Finished difference Result 1631 states and 1744 transitions. [2024-11-22 20:57:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 20:57:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 77 [2024-11-22 20:57:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:29,348 INFO L225 Difference]: With dead ends: 1631 [2024-11-22 20:57:29,348 INFO L226 Difference]: Without dead ends: 1625 [2024-11-22 20:57:29,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 20:57:29,349 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 24 mSDsluCounter, 17786 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 19407 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:29,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 19407 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 20:57:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-22 20:57:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2024-11-22 20:57:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 942 states have (on average 1.8067940552016986) internal successors, (1702), 1614 states have internal predecessors, (1702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 20:57:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1728 transitions. [2024-11-22 20:57:29,364 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1728 transitions. Word has length 77 [2024-11-22 20:57:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:29,364 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 1728 transitions. [2024-11-22 20:57:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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-11-22 20:57:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1728 transitions. [2024-11-22 20:57:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 20:57:29,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:29,365 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:29,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-22 20:57:29,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:29,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1169582016, now seen corresponding path program 4 times [2024-11-22 20:57:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197403814] [2024-11-22 20:57:29,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 20:57:29,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:29,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:29,570 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 20:57:29,971 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 20:57:29,971 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:29,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 20:57:29,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:30,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:57:31,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197403814] [2024-11-22 20:57:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197403814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:57:31,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:57:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 20:57:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506054061] [2024-11-22 20:57:31,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:57:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 20:57:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:57:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 20:57:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 20:57:31,692 INFO L87 Difference]: Start difference. First operand 1625 states and 1728 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-11-22 20:57:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:57:36,111 INFO L93 Difference]: Finished difference Result 1665 states and 1801 transitions. [2024-11-22 20:57:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 20:57:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-22 20:57:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:57:36,114 INFO L225 Difference]: With dead ends: 1665 [2024-11-22 20:57:36,114 INFO L226 Difference]: Without dead ends: 1661 [2024-11-22 20:57:36,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 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-11-22 20:57:36,116 INFO L432 NwaCegarLoop]: 1621 mSDtfsCounter, 49 mSDsluCounter, 40339 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 41960 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:57:36,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 41960 Invalid, 2266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:57:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-22 20:57:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1659. [2024-11-22 20:57:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 976 states have (on average 1.790983606557377) internal successors, (1748), 1648 states have internal predecessors, (1748), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 20:57:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 1774 transitions. [2024-11-22 20:57:36,149 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 1774 transitions. Word has length 89 [2024-11-22 20:57:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:57:36,149 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 1774 transitions. [2024-11-22 20:57:36,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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-11-22 20:57:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1774 transitions. [2024-11-22 20:57:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-22 20:57:36,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:57:36,150 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:57:36,161 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-11-22 20:57:36,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:36,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-22 20:57:36,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:57:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash 238496320, now seen corresponding path program 5 times [2024-11-22 20:57:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:57:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681341734] [2024-11-22 20:57:36,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:57:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:57:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:57:36,354 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 20:57:36,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 20:57:37,414 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 20:57:37,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:57:37,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-22 20:57:37,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:57:37,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:57:37,543 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 20:57:37,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-22 20:57:37,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 20:57:37,706 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-11-22 20:57:38,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:57:38,470 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-11-22 20:57:38,496 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-11-22 20:57:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-22 20:57:38,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:57:38,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (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~mem32#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-22 20:57:38,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:57:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681341734] [2024-11-22 20:57:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681341734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:57:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [230595341] [2024-11-22 20:57:38,801 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:57:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 20:57:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 20:57:38,803 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 20:57:38,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process