./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:00:49,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:00:49,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:00:49,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:00:49,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:00:49,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:00:49,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:00:49,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:00:49,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:00:49,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:00:49,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:00:49,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:00:49,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:00:49,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:00:49,247 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:00:49,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:00:49,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:00:49,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:00:49,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:00:49,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:00:49,250 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:00:49,250 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:00:49,250 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:00:49,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:00:49,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:00:49,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:00:49,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:00:49,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:00:49,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:00:49,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:00:49,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:00:49,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:00:49,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:00:49,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:00:49,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:00:49,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:00:49,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:00:49,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:00:49,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:00:49,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:00:49,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:00:49,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:00:49,257 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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2024-10-14 19:00:49,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:00:49,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:00:49,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:00:49,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:00:49,540 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:00:49,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-14 19:00:50,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:00:51,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:00:51,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-14 19:00:51,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4f5e060/b5530636461b4ef5bffd6b47f000dc5e/FLAG8143d6025 [2024-10-14 19:00:51,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4f5e060/b5530636461b4ef5bffd6b47f000dc5e [2024-10-14 19:00:51,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:00:51,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:00:51,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:00:51,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:00:51,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:00:51,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:00:51" (1/1) ... [2024-10-14 19:00:51,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40467c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:51, skipping insertion in model container [2024-10-14 19:00:51,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:00:51" (1/1) ... [2024-10-14 19:00:51,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:00:52,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:00:52,226 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:00:52,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d1847c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:52, skipping insertion in model container [2024-10-14 19:00:52,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:00:52,228 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:00:52,230 INFO L158 Benchmark]: Toolchain (without parser) took 645.64ms. Allocated memory is still 144.7MB. Free memory was 87.8MB in the beginning and 67.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:00:52,231 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 144.7MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:00:52,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.57ms. Allocated memory is still 144.7MB. Free memory was 87.5MB in the beginning and 67.1MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 19:00:52,234 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.10ms. Allocated memory is still 144.7MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.57ms. Allocated memory is still 144.7MB. Free memory was 87.5MB in the beginning and 67.1MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:00:54,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:00:54,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:00:54,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:00:54,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:00:54,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:00:54,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:00:54,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:00:54,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:00:54,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:00:54,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:00:54,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:00:54,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:00:54,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:00:54,434 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:00:54,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:00:54,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:00:54,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:00:54,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:00:54,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:00:54,436 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:00:54,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:00:54,441 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:00:54,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:00:54,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:00:54,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:00:54,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:00:54,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:00:54,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:00:54,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:00:54,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:00:54,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:00:54,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:00:54,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:00:54,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:00:54,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:00:54,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:00:54,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:00:54,447 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:00:54,447 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:00:54,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:00:54,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:00:54,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:00:54,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:00:54,448 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:00:54,449 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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2024-10-14 19:00:54,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:00:54,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:00:54,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:00:54,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:00:54,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:00:54,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-14 19:00:56,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:00:56,730 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:00:56,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-14 19:00:56,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b4a1141/41297b4c40b14c8181932e725e797b90/FLAG51f79a96e [2024-10-14 19:00:56,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b4a1141/41297b4c40b14c8181932e725e797b90 [2024-10-14 19:00:56,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:00:56,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:00:56,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:00:56,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:00:56,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:00:56,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:00:56" (1/1) ... [2024-10-14 19:00:56,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87abb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:56, skipping insertion in model container [2024-10-14 19:00:56,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:00:56" (1/1) ... [2024-10-14 19:00:57,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:00:57,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:00:57,612 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:00:57,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:00:57,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:00:57,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:00:57,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:00:57,903 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:00:57,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57 WrapperNode [2024-10-14 19:00:57,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:00:57,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:00:57,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:00:57,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:00:57,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:57,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,025 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 915 [2024-10-14 19:00:58,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:00:58,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:00:58,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:00:58,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:00:58,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,095 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-14 19:00:58,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:00:58,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:00:58,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:00:58,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:00:58,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (1/1) ... [2024-10-14 19:00:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:00:58,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:00:58,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:00:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:00:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:00:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:00:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:00:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:00:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:00:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:00:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:00:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:00:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:00:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:00:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:00:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:00:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:00:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:00:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:00:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:00:58,516 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:00:58,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:00:58,540 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:00:58,585 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:00:58,614 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:01:01,778 INFO L? ?]: Removed 878 outVars from TransFormulas that were not future-live. [2024-10-14 19:01:01,779 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:01:01,940 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:01:01,943 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-14 19:01:01,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:01:01 BoogieIcfgContainer [2024-10-14 19:01:01,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:01:01,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:01:01,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:01:01,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:01:01,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:00:56" (1/3) ... [2024-10-14 19:01:01,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76511c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:01:01, skipping insertion in model container [2024-10-14 19:01:01,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:00:57" (2/3) ... [2024-10-14 19:01:01,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76511c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:01:01, skipping insertion in model container [2024-10-14 19:01:01,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:01:01" (3/3) ... [2024-10-14 19:01:01,953 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2024-10-14 19:01:01,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:01:01,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-10-14 19:01:02,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:01:02,070 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;@1670c183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:01:02,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-10-14 19:01:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 19:01:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:01:02,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:02,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:01:02,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:02,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash 47005, now seen corresponding path program 1 times [2024-10-14 19:01:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109868960] [2024-10-14 19:01:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:02,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:02,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:02,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:01:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:02,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:02,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:02,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:02,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:02,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109868960] [2024-10-14 19:01:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109868960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:02,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:01:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619228782] [2024-10-14 19:01:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:02,333 INFO L87 Difference]: Start difference. First operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:03,774 INFO L93 Difference]: Finished difference Result 781 states and 838 transitions. [2024-10-14 19:01:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:03,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:01:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:03,798 INFO L225 Difference]: With dead ends: 781 [2024-10-14 19:01:03,799 INFO L226 Difference]: Without dead ends: 780 [2024-10-14 19:01:03,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:03,805 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 714 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:03,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 480 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:01:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-14 19:01:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2024-10-14 19:01:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 363 states have (on average 2.256198347107438) internal successors, (819), 773 states have internal predecessors, (819), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 837 transitions. [2024-10-14 19:01:03,919 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 837 transitions. Word has length 2 [2024-10-14 19:01:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:03,919 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 837 transitions. [2024-10-14 19:01:03,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 837 transitions. [2024-10-14 19:01:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:01:03,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:03,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:01:03,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:01:04,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:04,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 47006, now seen corresponding path program 1 times [2024-10-14 19:01:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:04,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716911201] [2024-10-14 19:01:04,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:04,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:04,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:04,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:01:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:04,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:04,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:04,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:04,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:04,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716911201] [2024-10-14 19:01:04,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716911201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:01:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892530174] [2024-10-14 19:01:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:04,257 INFO L87 Difference]: Start difference. First operand 780 states and 837 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:06,006 INFO L93 Difference]: Finished difference Result 984 states and 1073 transitions. [2024-10-14 19:01:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:01:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:06,011 INFO L225 Difference]: With dead ends: 984 [2024-10-14 19:01:06,011 INFO L226 Difference]: Without dead ends: 984 [2024-10-14 19:01:06,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:06,013 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 225 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:06,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1066 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:01:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-14 19:01:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 896. [2024-10-14 19:01:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 475 states have (on average 2.1957894736842105) internal successors, (1043), 889 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1071 transitions. [2024-10-14 19:01:06,044 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1071 transitions. Word has length 2 [2024-10-14 19:01:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:06,044 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1071 transitions. [2024-10-14 19:01:06,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1071 transitions. [2024-10-14 19:01:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:01:06,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:06,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:01:06,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:01:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:06,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:06,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash 460900519, now seen corresponding path program 1 times [2024-10-14 19:01:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000933023] [2024-10-14 19:01:06,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:06,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:06,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:06,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:01:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:06,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:01:06,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:06,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:06,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:06,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:01:06,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:01:06,476 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:01:06,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:01:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:06,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:06,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000933023] [2024-10-14 19:01:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000933023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552072885] [2024-10-14 19:01:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:06,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:06,503 INFO L87 Difference]: Start difference. First operand 896 states and 1071 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:08,169 INFO L93 Difference]: Finished difference Result 885 states and 1059 transitions. [2024-10-14 19:01:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:08,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 19:01:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:08,173 INFO L225 Difference]: With dead ends: 885 [2024-10-14 19:01:08,173 INFO L226 Difference]: Without dead ends: 885 [2024-10-14 19:01:08,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:08,176 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 786 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:08,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 259 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:01:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-14 19:01:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 768. [2024-10-14 19:01:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 363 states have (on average 2.2203856749311295) internal successors, (806), 761 states have internal predecessors, (806), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2024-10-14 19:01:08,195 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 6 [2024-10-14 19:01:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2024-10-14 19:01:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2024-10-14 19:01:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:01:08,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:08,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:01:08,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:08,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014203, now seen corresponding path program 1 times [2024-10-14 19:01:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338534479] [2024-10-14 19:01:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:08,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:08,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:08,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:01:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:08,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:08,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:08,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:08,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:08,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338534479] [2024-10-14 19:01:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338534479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:08,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:08,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906430355] [2024-10-14 19:01:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:08,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:08,573 INFO L87 Difference]: Start difference. First operand 768 states and 824 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:10,702 INFO L93 Difference]: Finished difference Result 1038 states and 1132 transitions. [2024-10-14 19:01:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:01:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:10,707 INFO L225 Difference]: With dead ends: 1038 [2024-10-14 19:01:10,707 INFO L226 Difference]: Without dead ends: 1038 [2024-10-14 19:01:10,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:10,710 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 462 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:10,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1034 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 19:01:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-14 19:01:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 785. [2024-10-14 19:01:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 390 states have (on average 2.2153846153846155) internal successors, (864), 778 states have internal predecessors, (864), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 882 transitions. [2024-10-14 19:01:10,730 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 882 transitions. Word has length 7 [2024-10-14 19:01:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:10,731 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 882 transitions. [2024-10-14 19:01:10,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 882 transitions. [2024-10-14 19:01:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:01:10,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:10,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:10,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:01:10,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:10,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:10,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014202, now seen corresponding path program 1 times [2024-10-14 19:01:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146912139] [2024-10-14 19:01:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:10,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:10,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:10,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:01:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:11,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:11,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:11,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:11,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-10-14 19:01:11,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:11,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146912139] [2024-10-14 19:01:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146912139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921502513] [2024-10-14 19:01:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:11,076 INFO L87 Difference]: Start difference. First operand 785 states and 882 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:12,414 INFO L93 Difference]: Finished difference Result 943 states and 1068 transitions. [2024-10-14 19:01:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:12,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:01:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:12,418 INFO L225 Difference]: With dead ends: 943 [2024-10-14 19:01:12,419 INFO L226 Difference]: Without dead ends: 943 [2024-10-14 19:01:12,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:12,420 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 681 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:12,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 724 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:01:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-14 19:01:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 738. [2024-10-14 19:01:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 390 states have (on average 2.0846153846153848) internal successors, (813), 731 states have internal predecessors, (813), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 831 transitions. [2024-10-14 19:01:12,443 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 831 transitions. Word has length 7 [2024-10-14 19:01:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:12,444 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 831 transitions. [2024-10-14 19:01:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 831 transitions. [2024-10-14 19:01:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 19:01:12,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:12,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:12,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:01:12,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:12,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:12,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 469131321, now seen corresponding path program 1 times [2024-10-14 19:01:12,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:12,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092841348] [2024-10-14 19:01:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:12,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:12,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:01:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:12,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:01:12,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:12,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:12,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:12,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:12,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 19:01:12,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:01:12,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 19:01:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:12,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:12,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092841348] [2024-10-14 19:01:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092841348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046182575] [2024-10-14 19:01:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:12,885 INFO L87 Difference]: Start difference. First operand 738 states and 831 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:14,081 INFO L93 Difference]: Finished difference Result 1459 states and 1647 transitions. [2024-10-14 19:01:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:14,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 19:01:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:14,087 INFO L225 Difference]: With dead ends: 1459 [2024-10-14 19:01:14,087 INFO L226 Difference]: Without dead ends: 1459 [2024-10-14 19:01:14,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:14,088 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 723 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:14,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1947 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:01:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-14 19:01:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 740. [2024-10-14 19:01:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 392 states have (on average 2.079081632653061) internal successors, (815), 733 states have internal predecessors, (815), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 833 transitions. [2024-10-14 19:01:14,107 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 833 transitions. Word has length 9 [2024-10-14 19:01:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:14,107 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 833 transitions. [2024-10-14 19:01:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 833 transitions. [2024-10-14 19:01:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:01:14,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:14,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:14,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:01:14,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:14,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:14,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1384503377, now seen corresponding path program 1 times [2024-10-14 19:01:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272071573] [2024-10-14 19:01:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:14,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:14,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:01:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:14,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:01:14,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:14,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:14,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272071573] [2024-10-14 19:01:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272071573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:14,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:14,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398071582] [2024-10-14 19:01:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:14,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:14,462 INFO L87 Difference]: Start difference. First operand 740 states and 833 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:14,929 INFO L93 Difference]: Finished difference Result 701 states and 793 transitions. [2024-10-14 19:01:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:01:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:14,934 INFO L225 Difference]: With dead ends: 701 [2024-10-14 19:01:14,934 INFO L226 Difference]: Without dead ends: 701 [2024-10-14 19:01:14,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:14,935 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 61 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:14,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1206 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:01:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-14 19:01:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-14 19:01:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 377 states have (on average 2.055702917771883) internal successors, (775), 694 states have internal predecessors, (775), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 793 transitions. [2024-10-14 19:01:14,948 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 793 transitions. Word has length 15 [2024-10-14 19:01:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:14,949 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 793 transitions. [2024-10-14 19:01:14,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 793 transitions. [2024-10-14 19:01:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:01:14,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:14,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:15,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:15,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -932119221, now seen corresponding path program 1 times [2024-10-14 19:01:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614756746] [2024-10-14 19:01:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:15,156 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:01:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:15,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:15,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:15,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:15,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614756746] [2024-10-14 19:01:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614756746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094903562] [2024-10-14 19:01:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:15,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:15,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:15,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:15,340 INFO L87 Difference]: Start difference. First operand 701 states and 793 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:15,963 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-14 19:01:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:01:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 19:01:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:15,969 INFO L225 Difference]: With dead ends: 686 [2024-10-14 19:01:15,969 INFO L226 Difference]: Without dead ends: 686 [2024-10-14 19:01:15,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:15,970 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 45 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:15,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1761 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:01:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-14 19:01:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-10-14 19:01:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 376 states have (on average 2.002659574468085) internal successors, (753), 679 states have internal predecessors, (753), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 771 transitions. [2024-10-14 19:01:15,984 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 771 transitions. Word has length 17 [2024-10-14 19:01:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:15,985 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 771 transitions. [2024-10-14 19:01:15,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 771 transitions. [2024-10-14 19:01:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:01:15,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:15,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:15,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:01:16,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:16,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162457, now seen corresponding path program 1 times [2024-10-14 19:01:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548158776] [2024-10-14 19:01:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:16,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:16,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:16,194 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:01:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:16,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:16,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:16,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:16,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:16,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548158776] [2024-10-14 19:01:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548158776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664743620] [2024-10-14 19:01:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:16,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:16,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:16,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:16,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:16,459 INFO L87 Difference]: Start difference. First operand 686 states and 771 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:17,850 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-14 19:01:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:17,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:01:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:17,853 INFO L225 Difference]: With dead ends: 686 [2024-10-14 19:01:17,853 INFO L226 Difference]: Without dead ends: 686 [2024-10-14 19:01:17,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:17,854 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 623 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:17,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 613 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:01:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-14 19:01:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 682. [2024-10-14 19:01:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 376 states have (on average 1.9920212765957446) internal successors, (749), 675 states have internal predecessors, (749), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 767 transitions. [2024-10-14 19:01:17,867 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 767 transitions. Word has length 31 [2024-10-14 19:01:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:17,868 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 767 transitions. [2024-10-14 19:01:17,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 767 transitions. [2024-10-14 19:01:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:01:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:17,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:17,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:01:18,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:18,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162458, now seen corresponding path program 1 times [2024-10-14 19:01:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941628624] [2024-10-14 19:01:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:18,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:18,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:18,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:18,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:01:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:18,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:01:18,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:18,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:18,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:18,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941628624] [2024-10-14 19:01:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941628624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152736216] [2024-10-14 19:01:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:18,424 INFO L87 Difference]: Start difference. First operand 682 states and 767 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:20,309 INFO L93 Difference]: Finished difference Result 935 states and 1017 transitions. [2024-10-14 19:01:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:01:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:20,315 INFO L225 Difference]: With dead ends: 935 [2024-10-14 19:01:20,315 INFO L226 Difference]: Without dead ends: 935 [2024-10-14 19:01:20,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:20,316 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 400 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:20,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1039 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:01:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-10-14 19:01:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 678. [2024-10-14 19:01:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 376 states have (on average 1.9813829787234043) internal successors, (745), 671 states have internal predecessors, (745), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 763 transitions. [2024-10-14 19:01:20,331 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 763 transitions. Word has length 31 [2024-10-14 19:01:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 763 transitions. [2024-10-14 19:01:20,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 763 transitions. [2024-10-14 19:01:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 19:01:20,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:20,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:20,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:20,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:20,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:20,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1916251283, now seen corresponding path program 1 times [2024-10-14 19:01:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337944929] [2024-10-14 19:01:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:20,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:20,540 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:20,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:01:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:20,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:20,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:20,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:20,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337944929] [2024-10-14 19:01:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337944929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:20,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284354520] [2024-10-14 19:01:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:20,763 INFO L87 Difference]: Start difference. First operand 678 states and 763 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:21,287 INFO L93 Difference]: Finished difference Result 672 states and 753 transitions. [2024-10-14 19:01:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:01:21,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-14 19:01:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:21,291 INFO L225 Difference]: With dead ends: 672 [2024-10-14 19:01:21,291 INFO L226 Difference]: Without dead ends: 672 [2024-10-14 19:01:21,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:21,292 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 15 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:21,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1744 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:01:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-14 19:01:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-14 19:01:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 370 states have (on average 1.9864864864864864) internal successors, (735), 665 states have internal predecessors, (735), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:01:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 753 transitions. [2024-10-14 19:01:21,304 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 753 transitions. Word has length 47 [2024-10-14 19:01:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:21,305 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 753 transitions. [2024-10-14 19:01:21,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 753 transitions. [2024-10-14 19:01:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:01:21,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:21,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:21,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:21,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:21,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:21,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 227917556, now seen corresponding path program 1 times [2024-10-14 19:01:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753647554] [2024-10-14 19:01:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:21,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:21,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:21,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:21,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:01:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:21,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:21,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:21,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:22,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753647554] [2024-10-14 19:01:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753647554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:22,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:01:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310366210] [2024-10-14 19:01:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:22,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:01:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:01:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:22,002 INFO L87 Difference]: Start difference. First operand 672 states and 753 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:22,642 INFO L93 Difference]: Finished difference Result 853 states and 957 transitions. [2024-10-14 19:01:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:01:22,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 19:01:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:22,648 INFO L225 Difference]: With dead ends: 853 [2024-10-14 19:01:22,648 INFO L226 Difference]: Without dead ends: 853 [2024-10-14 19:01:22,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:01:22,649 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 146 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:22,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1270 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:01:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-14 19:01:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 799. [2024-10-14 19:01:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 492 states have (on average 1.8821138211382114) internal successors, (926), 792 states have internal predecessors, (926), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 954 transitions. [2024-10-14 19:01:22,663 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 954 transitions. Word has length 51 [2024-10-14 19:01:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:22,663 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 954 transitions. [2024-10-14 19:01:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 954 transitions. [2024-10-14 19:01:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:01:22,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:22,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:22,673 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-10-14 19:01:22,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:22,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:22,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash -558822258, now seen corresponding path program 1 times [2024-10-14 19:01:22,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253686007] [2024-10-14 19:01:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:22,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:22,871 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:01:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:23,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:01:23,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:23,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:23,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:23,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:01:23,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:01:23,718 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:01:23,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:01:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:23,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:23,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:23,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253686007] [2024-10-14 19:01:23,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253686007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:23,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:01:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859169512] [2024-10-14 19:01:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:23,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:23,735 INFO L87 Difference]: Start difference. First operand 799 states and 954 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:24,847 INFO L93 Difference]: Finished difference Result 761 states and 916 transitions. [2024-10-14 19:01:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 19:01:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:24,850 INFO L225 Difference]: With dead ends: 761 [2024-10-14 19:01:24,850 INFO L226 Difference]: Without dead ends: 761 [2024-10-14 19:01:24,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:24,851 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1114 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:24,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 203 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:01:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-14 19:01:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 734. [2024-10-14 19:01:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2024-10-14 19:01:24,862 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 54 [2024-10-14 19:01:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:24,863 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2024-10-14 19:01:24,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2024-10-14 19:01:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:01:24,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:24,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:24,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 19:01:25,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:25,069 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 277799603, now seen corresponding path program 1 times [2024-10-14 19:01:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064994438] [2024-10-14 19:01:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:25,071 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:25,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 19:01:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:25,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:01:25,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:25,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:01:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:01:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:25,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:25,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064994438] [2024-10-14 19:01:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064994438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71503390] [2024-10-14 19:01:25,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:25,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:01:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:01:25,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:25,372 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:26,766 INFO L93 Difference]: Finished difference Result 733 states and 851 transitions. [2024-10-14 19:01:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:01:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 19:01:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:26,770 INFO L225 Difference]: With dead ends: 733 [2024-10-14 19:01:26,770 INFO L226 Difference]: Without dead ends: 733 [2024-10-14 19:01:26,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:01:26,770 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:26,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:01:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-14 19:01:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-14 19:01:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 465 states have (on average 1.7698924731182795) internal successors, (823), 726 states have internal predecessors, (823), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 851 transitions. [2024-10-14 19:01:26,782 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 851 transitions. Word has length 58 [2024-10-14 19:01:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:26,783 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 851 transitions. [2024-10-14 19:01:26,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 851 transitions. [2024-10-14 19:01:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:01:26,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:26,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:26,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 19:01:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:26,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 277799604, now seen corresponding path program 1 times [2024-10-14 19:01:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:26,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482568398] [2024-10-14 19:01:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:26,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:26,989 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:26,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:01:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:27,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:01:27,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:27,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:27,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:01:27,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:01:27,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:01:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:27,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:27,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482568398] [2024-10-14 19:01:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482568398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578013138] [2024-10-14 19:01:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:01:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:01:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:01:27,365 INFO L87 Difference]: Start difference. First operand 733 states and 851 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:28,981 INFO L93 Difference]: Finished difference Result 732 states and 850 transitions. [2024-10-14 19:01:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:01:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 19:01:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:28,985 INFO L225 Difference]: With dead ends: 732 [2024-10-14 19:01:28,985 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 19:01:28,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:01:28,986 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:28,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1523 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:01:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 19:01:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2024-10-14 19:01:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 464 states have (on average 1.771551724137931) internal successors, (822), 725 states have internal predecessors, (822), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:01:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 850 transitions. [2024-10-14 19:01:29,002 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 850 transitions. Word has length 58 [2024-10-14 19:01:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:29,003 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 850 transitions. [2024-10-14 19:01:29,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:01:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 850 transitions. [2024-10-14 19:01:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:01:29,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:29,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:29,014 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-10-14 19:01:29,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:29,206 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:29,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2144797065, now seen corresponding path program 1 times [2024-10-14 19:01:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55598521] [2024-10-14 19:01:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:29,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:29,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:29,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:29,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:01:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:29,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:01:29,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:29,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:01:29,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55598521] [2024-10-14 19:01:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55598521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:01:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:01:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:01:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652966419] [2024-10-14 19:01:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:01:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:01:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:01:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:29,475 INFO L87 Difference]: Start difference. First operand 732 states and 850 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:01:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:29,994 INFO L93 Difference]: Finished difference Result 734 states and 853 transitions. [2024-10-14 19:01:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:01:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-10-14 19:01:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:29,999 INFO L225 Difference]: With dead ends: 734 [2024-10-14 19:01:29,999 INFO L226 Difference]: Without dead ends: 734 [2024-10-14 19:01:29,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:01:30,000 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:30,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:01:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-14 19:01:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2024-10-14 19:01:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:01:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 853 transitions. [2024-10-14 19:01:30,017 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 853 transitions. Word has length 64 [2024-10-14 19:01:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 853 transitions. [2024-10-14 19:01:30,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:01:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 853 transitions. [2024-10-14 19:01:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:01:30,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:30,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:30,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 19:01:30,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:30,219 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 56877357, now seen corresponding path program 1 times [2024-10-14 19:01:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292517134] [2024-10-14 19:01:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:01:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:30,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:30,223 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:30,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:01:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:01:30,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:01:30,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:30,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:01:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:30,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292517134] [2024-10-14 19:01:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292517134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:01:30,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:01:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:01:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538302057] [2024-10-14 19:01:30,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:01:30,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:01:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:01:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:01:30,584 INFO L87 Difference]: Start difference. First operand 734 states and 853 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:31,520 INFO L93 Difference]: Finished difference Result 743 states and 867 transitions. [2024-10-14 19:01:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:01:31,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-14 19:01:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:31,525 INFO L225 Difference]: With dead ends: 743 [2024-10-14 19:01:31,526 INFO L226 Difference]: Without dead ends: 743 [2024-10-14 19:01:31,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:01:31,527 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:31,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3350 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:01:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-14 19:01:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2024-10-14 19:01:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 472 states have (on average 1.7733050847457628) internal successors, (837), 734 states have internal predecessors, (837), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:01:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 866 transitions. [2024-10-14 19:01:31,539 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 866 transitions. Word has length 65 [2024-10-14 19:01:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:31,539 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 866 transitions. [2024-10-14 19:01:31,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 866 transitions. [2024-10-14 19:01:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:01:31,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:31,544 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:31,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 19:01:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:31,745 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -383321097, now seen corresponding path program 2 times [2024-10-14 19:01:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42924857] [2024-10-14 19:01:31,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:01:31,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:31,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:31,749 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:31,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:01:32,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:01:32,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:01:32,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:01:32,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:32,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:01:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:32,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42924857] [2024-10-14 19:01:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42924857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:01:32,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:01:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:01:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603567936] [2024-10-14 19:01:32,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:01:32,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:01:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:01:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:01:32,373 INFO L87 Difference]: Start difference. First operand 742 states and 866 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:33,638 INFO L93 Difference]: Finished difference Result 754 states and 885 transitions. [2024-10-14 19:01:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:01:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-14 19:01:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:33,642 INFO L225 Difference]: With dead ends: 754 [2024-10-14 19:01:33,642 INFO L226 Difference]: Without dead ends: 752 [2024-10-14 19:01:33,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-10-14 19:01:33,643 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 7 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:33,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3912 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:01:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-14 19:01:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 751. [2024-10-14 19:01:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 481 states have (on average 1.7650727650727651) internal successors, (849), 743 states have internal predecessors, (849), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:01:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 878 transitions. [2024-10-14 19:01:33,661 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 878 transitions. Word has length 68 [2024-10-14 19:01:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:33,662 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 878 transitions. [2024-10-14 19:01:33,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 878 transitions. [2024-10-14 19:01:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:01:33,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:33,663 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:33,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:33,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:33,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -68956105, now seen corresponding path program 3 times [2024-10-14 19:01:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376939940] [2024-10-14 19:01:33,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:01:33,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:33,867 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:33,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:01:34,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:01:34,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:01:34,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:01:34,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:34,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:01:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:35,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376939940] [2024-10-14 19:01:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376939940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:01:35,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:01:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:01:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738219960] [2024-10-14 19:01:35,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:01:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:01:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:35,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:01:35,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:01:35,113 INFO L87 Difference]: Start difference. First operand 751 states and 878 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:38,395 INFO L93 Difference]: Finished difference Result 772 states and 914 transitions. [2024-10-14 19:01:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:01:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-14 19:01:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:38,398 INFO L225 Difference]: With dead ends: 772 [2024-10-14 19:01:38,398 INFO L226 Difference]: Without dead ends: 769 [2024-10-14 19:01:38,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:01:38,400 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 14 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7265 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:38,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7265 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:01:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-14 19:01:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-10-14 19:01:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 499 states have (on average 1.74749498997996) internal successors, (872), 761 states have internal predecessors, (872), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:01:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 901 transitions. [2024-10-14 19:01:38,412 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 901 transitions. Word has length 74 [2024-10-14 19:01:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:38,413 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 901 transitions. [2024-10-14 19:01:38,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 901 transitions. [2024-10-14 19:01:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:01:38,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:38,414 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:38,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 (20)] Ended with exit code 0 [2024-10-14 19:01:38,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:38,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:38,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -283055945, now seen corresponding path program 4 times [2024-10-14 19:01:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:38,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261182585] [2024-10-14 19:01:38,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:01:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:38,619 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:38,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:01:39,100 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:01:39,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:01:39,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:01:39,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:39,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:01:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:01:40,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:40,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261182585] [2024-10-14 19:01:40,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261182585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:01:40,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:01:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:01:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112834282] [2024-10-14 19:01:40,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:01:40,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:01:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:01:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:01:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:01:40,641 INFO L87 Difference]: Start difference. First operand 769 states and 901 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:01:48,472 INFO L93 Difference]: Finished difference Result 806 states and 970 transitions. [2024-10-14 19:01:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:01:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-14 19:01:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:01:48,476 INFO L225 Difference]: With dead ends: 806 [2024-10-14 19:01:48,477 INFO L226 Difference]: Without dead ends: 804 [2024-10-14 19:01:48,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:01:48,479 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 25 mSDsluCounter, 13415 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13975 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:01:48,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13975 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 19:01:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-14 19:01:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2024-10-14 19:01:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.722326454033771) internal successors, (918), 795 states have internal predecessors, (918), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:01:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 947 transitions. [2024-10-14 19:01:48,491 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 947 transitions. Word has length 86 [2024-10-14 19:01:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:01:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 947 transitions. [2024-10-14 19:01:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:01:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 947 transitions. [2024-10-14 19:01:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:01:48,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:01:48,492 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:01:48,506 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 (21)] Forceful destruction successful, exit code 0 [2024-10-14 19:01:48,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:48,693 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-14 19:01:48,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:01:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1655463177, now seen corresponding path program 5 times [2024-10-14 19:01:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:01:48,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060006351] [2024-10-14 19:01:48,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:01:48,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:01:48,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:01:48,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:01:48,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:01:49,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:01:49,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:01:49,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 19:01:49,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:49,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:49,991 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:01:49,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:01:50,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:01:50,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 19:01:51,047 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:01:51,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:01:51,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-14 19:01:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:01:51,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:01:51,536 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-10-14 19:01:51,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:01:51,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060006351] [2024-10-14 19:01:51,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060006351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:01:51,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1287465139] [2024-10-14 19:01:51,538 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:01:51,539 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:01:51,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:01:51,542 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:01:51,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-14 19:01:52,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:01:52,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:01:52,110 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 619 conjuncts are in the unsatisfiable core [2024-10-14 19:01:52,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:01:52,145 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 8 treesize of output 1 [2024-10-14 19:01:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:01:52,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:01:52,262 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:01:52,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:01:52,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:01:52,507 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 8 treesize of output 1 [2024-10-14 19:01:52,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:01:52,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:01:52,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:01:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:02:09,749 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 8 treesize of output 1 [2024-10-14 19:02:09,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989