./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-hlist-fst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/memsafety-broom/linux-hlist-fst-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 46375ed9ade4b2d65667cb37da90bf348054cd9152c2ac636867bc968395ff61 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:05:18,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:05:18,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 18:05:18,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:05:18,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:05:18,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:05:18,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:05:18,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:05:18,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:05:18,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:05:18,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:05:18,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:05:18,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:05:18,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:05:18,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:05:18,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:05:18,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:05:18,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:05:18,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:05:18,263 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:05:18,263 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:05:18,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:05:18,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:05:18,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:05:18,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:05:18,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:05:18,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:05:18,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:05:18,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:05:18,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:05:18,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:05:18,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:05:18,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:05:18,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:05:18,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:05:18,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:05:18,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:05:18,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:05:18,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:05:18,271 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46375ed9ade4b2d65667cb37da90bf348054cd9152c2ac636867bc968395ff61 [2024-10-14 18:05:18,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:05:18,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:05:18,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:05:18,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:05:18,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:05:18,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-hlist-fst-data.i [2024-10-14 18:05:20,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:05:20,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:05:20,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-hlist-fst-data.i [2024-10-14 18:05:20,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdefb9ac9/11062c20584b463d986b8c23405bea69/FLAG3e9a3c9f0 [2024-10-14 18:05:20,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdefb9ac9/11062c20584b463d986b8c23405bea69 [2024-10-14 18:05:20,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:05:20,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:05:20,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:20,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:05:20,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:05:20,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:20" (1/1) ... [2024-10-14 18:05:20,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac1eeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:20, skipping insertion in model container [2024-10-14 18:05:20,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:20" (1/1) ... [2024-10-14 18:05:20,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:05:20,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:20,860 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 18:05:20,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e774ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:20, skipping insertion in model container [2024-10-14 18:05:20,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:20,861 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 18:05:20,863 INFO L158 Benchmark]: Toolchain (without parser) took 411.61ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 93.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:05:20,864 INFO L158 Benchmark]: CDTParser took 3.75ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 131.0MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:05:20,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.69ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 93.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 18:05:20,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.75ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 131.0MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.69ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 93.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2566]: 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/memsafety-broom/linux-hlist-fst-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 46375ed9ade4b2d65667cb37da90bf348054cd9152c2ac636867bc968395ff61 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:05:23,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:05:23,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-14 18:05:23,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:05:23,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:05:23,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:05:23,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:05:23,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:05:23,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:05:23,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:05:23,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:05:23,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:05:23,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:05:23,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:05:23,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:05:23,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:05:23,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:05:23,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:05:23,274 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:05:23,275 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:05:23,275 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:05:23,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:05:23,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:05:23,276 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 18:05:23,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:05:23,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 18:05:23,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:05:23,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:05:23,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:05:23,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:05:23,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:05:23,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:05:23,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:05:23,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:05:23,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:05:23,281 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 18:05:23,281 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 18:05:23,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:05:23,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:05:23,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:05:23,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:05:23,283 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 18:05:23,283 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46375ed9ade4b2d65667cb37da90bf348054cd9152c2ac636867bc968395ff61 [2024-10-14 18:05:23,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:05:23,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:05:23,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:05:23,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:05:23,645 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:05:23,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-hlist-fst-data.i [2024-10-14 18:05:25,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:05:25,566 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:05:25,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-hlist-fst-data.i [2024-10-14 18:05:25,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb02a79f5/af16c1e9111a43ac8b443f6a53220e97/FLAG57646a0b8 [2024-10-14 18:05:25,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb02a79f5/af16c1e9111a43ac8b443f6a53220e97 [2024-10-14 18:05:25,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:05:25,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:05:25,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:25,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:05:25,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:05:25,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:25" (1/1) ... [2024-10-14 18:05:25,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2655e7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:25, skipping insertion in model container [2024-10-14 18:05:25,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:25" (1/1) ... [2024-10-14 18:05:25,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:05:26,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:26,067 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 18:05:26,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:05:26,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:26,145 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:05:26,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:26,243 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:05:26,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26 WrapperNode [2024-10-14 18:05:26,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:26,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:05:26,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:05:26,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:05:26,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,309 INFO L138 Inliner]: procedures = 125, calls = 33, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 154 [2024-10-14 18:05:26,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:05:26,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:05:26,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:05:26,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:05:26,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,372 INFO L175 MemorySlicer]: Split 19 memory accesses to 1 slices as follows [19]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 12 writes are split as follows [12]. [2024-10-14 18:05:26,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:05:26,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:05:26,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:05:26,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:05:26,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (1/1) ... [2024-10-14 18:05:26,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:05:26,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:26,453 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 18:05:26,458 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 18:05:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:05:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:05:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:05:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:05:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 18:05:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:05:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:05:26,664 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:05:26,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:05:27,293 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-10-14 18:05:27,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:05:27,346 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:05:27,348 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 18:05:27,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:27 BoogieIcfgContainer [2024-10-14 18:05:27,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:05:27,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:05:27,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:05:27,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:05:27,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:05:25" (1/3) ... [2024-10-14 18:05:27,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351aca24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:27, skipping insertion in model container [2024-10-14 18:05:27,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:26" (2/3) ... [2024-10-14 18:05:27,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351aca24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:27, skipping insertion in model container [2024-10-14 18:05:27,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:27" (3/3) ... [2024-10-14 18:05:27,358 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-hlist-fst-data.i [2024-10-14 18:05:27,375 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:05:27,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-10-14 18:05:27,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:05:27,449 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;@1450e50d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:05:27,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-10-14 18:05:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 46 states have (on average 2.260869565217391) internal successors, (104), 91 states have internal predecessors, (104), 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 18:05:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 18:05:27,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:27,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 18:05:27,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:27,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash 7103, now seen corresponding path program 1 times [2024-10-14 18:05:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883488068] [2024-10-14 18:05:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:27,488 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 18:05:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:27,492 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 18:05:27,494 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 18:05:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:27,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:05:27,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:27,637 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 18:05:27,653 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 18:05:27,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:27,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883488068] [2024-10-14 18:05:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883488068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:05:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238219834] [2024-10-14 18:05:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:27,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:27,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:27,695 INFO L87 Difference]: Start difference. First operand has 92 states, 46 states have (on average 2.260869565217391) internal successors, (104), 91 states have internal predecessors, (104), 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) 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 18:05:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:27,934 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-14 18:05:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:27,937 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 18:05:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:27,944 INFO L225 Difference]: With dead ends: 91 [2024-10-14 18:05:27,945 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 18:05:27,947 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 18:05:27,950 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:27,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 18:05:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 18:05:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 46 states have (on average 2.152173913043478) internal successors, (99), 89 states have internal predecessors, (99), 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 18:05:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-10-14 18:05:27,992 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 2 [2024-10-14 18:05:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-10-14 18:05:27,993 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 18:05:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-10-14 18:05:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 18:05:27,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:27,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 18:05:28,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:28,196 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 18:05:28,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:28,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash 7104, now seen corresponding path program 1 times [2024-10-14 18:05:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681434269] [2024-10-14 18:05:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:28,198 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 18:05:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:28,200 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 18:05:28,201 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 18:05:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:28,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:05:28,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:28,278 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 18:05:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:28,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:28,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681434269] [2024-10-14 18:05:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681434269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:28,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:28,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 18:05:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260720060] [2024-10-14 18:05:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:28,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:28,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:28,296 INFO L87 Difference]: Start difference. First operand 90 states and 99 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 18:05:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:28,623 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-10-14 18:05:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:28,624 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 18:05:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:28,626 INFO L225 Difference]: With dead ends: 92 [2024-10-14 18:05:28,626 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 18:05:28,626 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 18:05:28,627 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:28,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 18:05:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-14 18:05:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 46 states have (on average 2.130434782608696) internal successors, (98), 88 states have internal predecessors, (98), 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 18:05:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-14 18:05:28,635 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 2 [2024-10-14 18:05:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-14 18:05:28,636 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 18:05:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-14 18:05:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:05:28,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:28,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:05:28,640 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 18:05:28,839 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 18:05:28,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 211585774, now seen corresponding path program 1 times [2024-10-14 18:05:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450733913] [2024-10-14 18:05:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:28,842 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 18:05:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:28,843 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 18:05:28,845 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 18:05:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:28,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:05:28,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:28,929 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 18:05:28,937 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 18:05:28,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:28,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450733913] [2024-10-14 18:05:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450733913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200835657] [2024-10-14 18:05:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:28,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:28,940 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:29,179 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-14 18:05:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:05:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:29,180 INFO L225 Difference]: With dead ends: 87 [2024-10-14 18:05:29,181 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 18:05:29,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:29,184 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:29,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 18:05:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 18:05:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 86 states have internal predecessors, (96), 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 18:05:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-14 18:05:29,195 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 5 [2024-10-14 18:05:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-14 18:05:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-14 18:05:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:05:29,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:29,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:05:29,201 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 18:05:29,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 18:05:29,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:29,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 211585775, now seen corresponding path program 1 times [2024-10-14 18:05:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104726645] [2024-10-14 18:05:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:29,399 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 18:05:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:29,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 18:05:29,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 18:05:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:29,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:05:29,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:29,481 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 18:05:29,494 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 18:05:29,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:29,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104726645] [2024-10-14 18:05:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104726645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:29,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326951290] [2024-10-14 18:05:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:29,497 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:29,773 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-14 18:05:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:05:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:29,774 INFO L225 Difference]: With dead ends: 85 [2024-10-14 18:05:29,774 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 18:05:29,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:29,776 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:29,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 18:05:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 18:05:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 2.0434782608695654) internal successors, (94), 84 states have internal predecessors, (94), 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 18:05:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-10-14 18:05:29,781 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 5 [2024-10-14 18:05:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:29,781 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-10-14 18:05:29,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-10-14 18:05:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:05:29,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:29,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:05:29,786 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 18:05:29,982 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 18:05:29,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2030771943, now seen corresponding path program 1 times [2024-10-14 18:05:29,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:29,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664306348] [2024-10-14 18:05:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:29,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:29,986 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 18:05:29,987 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 18:05:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:05:30,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:30,110 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 18:05:30,144 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 18:05:30,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:30,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664306348] [2024-10-14 18:05:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664306348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253279409] [2024-10-14 18:05:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:30,147 INFO L87 Difference]: Start difference. First operand 85 states and 94 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 18:05:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:30,413 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-14 18:05:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:30,413 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 18:05:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:30,414 INFO L225 Difference]: With dead ends: 84 [2024-10-14 18:05:30,414 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 18:05:30,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 18:05:30,415 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:30,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 151 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 18:05:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 18:05:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 83 states have internal predecessors, (93), 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 18:05:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-14 18:05:30,426 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 6 [2024-10-14 18:05:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:30,427 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-14 18:05:30,427 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 18:05:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-14 18:05:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:05:30,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:30,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:05:30,435 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 18:05:30,631 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 18:05:30,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2030771942, now seen corresponding path program 1 times [2024-10-14 18:05:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:30,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529412962] [2024-10-14 18:05:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:30,633 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 18:05:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:30,634 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 18:05:30,635 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 18:05:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:05:30,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:30,709 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 18:05:30,770 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 18:05:30,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:30,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529412962] [2024-10-14 18:05:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529412962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:30,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:30,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161455696] [2024-10-14 18:05:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:30,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:30,773 INFO L87 Difference]: Start difference. First operand 84 states and 93 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 18:05:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:31,050 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-10-14 18:05:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:31,051 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 18:05:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:31,051 INFO L225 Difference]: With dead ends: 88 [2024-10-14 18:05:31,051 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 18:05:31,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 18:05:31,052 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:31,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 18:05:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 18:05:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.96) internal successors, (98), 87 states have internal predecessors, (98), 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 18:05:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-10-14 18:05:31,058 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 6 [2024-10-14 18:05:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:31,059 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-14 18:05:31,059 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 18:05:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-10-14 18:05:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 18:05:31,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:31,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:31,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:31,260 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 18:05:31,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:31,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1470471135, now seen corresponding path program 1 times [2024-10-14 18:05:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81232808] [2024-10-14 18:05:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:31,262 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 18:05:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:31,265 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 18:05:31,266 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 18:05:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:05:31,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:31,354 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 18:05:31,372 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 18:05:31,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:31,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81232808] [2024-10-14 18:05:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81232808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567869099] [2024-10-14 18:05:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:31,375 INFO L87 Difference]: Start difference. First operand 88 states and 98 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 18:05:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:31,515 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2024-10-14 18:05:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:31,516 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 18:05:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:31,517 INFO L225 Difference]: With dead ends: 87 [2024-10-14 18:05:31,517 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 18:05:31,517 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 18:05:31,518 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:31,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 18:05:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 18:05:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.94) internal successors, (97), 86 states have internal predecessors, (97), 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 18:05:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-10-14 18:05:31,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 7 [2024-10-14 18:05:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:31,523 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-10-14 18:05:31,523 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 18:05:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-10-14 18:05:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 18:05:31,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:31,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:31,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 18:05:31,724 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 18:05:31,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1470471136, now seen corresponding path program 1 times [2024-10-14 18:05:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327825256] [2024-10-14 18:05:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:31,726 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 18:05:31,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:31,730 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 18:05:31,733 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 18:05:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:05:31,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:31,807 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 18:05:31,830 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 18:05:31,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:31,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327825256] [2024-10-14 18:05:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327825256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:31,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:31,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581144115] [2024-10-14 18:05:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:31,832 INFO L87 Difference]: Start difference. First operand 87 states and 97 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 18:05:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:32,048 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-10-14 18:05:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:32,049 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 18:05:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:32,049 INFO L225 Difference]: With dead ends: 86 [2024-10-14 18:05:32,049 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 18:05:32,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:32,050 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:32,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 18:05:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 18:05:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.92) internal successors, (96), 85 states have internal predecessors, (96), 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 18:05:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-10-14 18:05:32,054 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 7 [2024-10-14 18:05:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:32,054 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-10-14 18:05:32,054 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 18:05:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-10-14 18:05:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:05:32,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:32,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:32,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:32,255 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 18:05:32,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:32,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1660029803, now seen corresponding path program 1 times [2024-10-14 18:05:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:32,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752093255] [2024-10-14 18:05:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:32,257 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 18:05:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:32,258 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 18:05:32,259 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 18:05:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:32,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:05:32,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:32,378 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 18:05:32,438 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-14 18:05:32,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 18:05:32,462 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 18:05:32,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:32,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752093255] [2024-10-14 18:05:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752093255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:32,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031786291] [2024-10-14 18:05:32,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:32,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:32,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:32,464 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:32,662 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-14 18:05:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 18:05:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:32,663 INFO L225 Difference]: With dead ends: 84 [2024-10-14 18:05:32,663 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 18:05:32,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 18:05:32,664 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:32,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 144 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 18:05:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 18:05:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.88) internal successors, (94), 83 states have internal predecessors, (94), 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 18:05:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-14 18:05:32,671 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 8 [2024-10-14 18:05:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:32,671 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-14 18:05:32,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-14 18:05:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:05:32,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:32,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:32,679 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 18:05:32,872 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 18:05:32,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:32,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1660029802, now seen corresponding path program 1 times [2024-10-14 18:05:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267884729] [2024-10-14 18:05:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:32,874 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 18:05:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:32,875 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 18:05:32,877 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 18:05:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:05:33,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:33,043 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 18:05:33,056 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 18:05:33,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:33,123 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 18:05:33,135 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:05:33,136 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 18:05:33,190 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 18:05:33,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:33,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267884729] [2024-10-14 18:05:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267884729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704795083] [2024-10-14 18:05:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:33,192 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:33,439 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-10-14 18:05:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 18:05:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:33,441 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:05:33,441 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:05:33,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:05:33,442 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 44 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:33,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 145 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:05:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:05:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.84) internal successors, (92), 81 states have internal predecessors, (92), 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 18:05:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-10-14 18:05:33,445 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2024-10-14 18:05:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-10-14 18:05:33,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-10-14 18:05:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:05:33,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:33,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:33,455 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 18:05:33,646 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 18:05:33,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:33,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 78688590, now seen corresponding path program 1 times [2024-10-14 18:05:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505677612] [2024-10-14 18:05:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:33,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:33,651 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 18:05:33,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 (12)] Waiting until timeout for monitored process [2024-10-14 18:05:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:05:33,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:33,763 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 18:05:33,783 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 18:05:33,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:33,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:33,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505677612] [2024-10-14 18:05:33,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505677612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:33,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:33,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926518983] [2024-10-14 18:05:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:33,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:33,786 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:33,960 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-10-14 18:05:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 18:05:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:33,961 INFO L225 Difference]: With dead ends: 80 [2024-10-14 18:05:33,961 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 18:05:33,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 18:05:33,962 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:33,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 18:05:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 18:05:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.8) internal successors, (90), 79 states have internal predecessors, (90), 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 18:05:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-10-14 18:05:33,965 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 9 [2024-10-14 18:05:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:33,965 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-10-14 18:05:33,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-10-14 18:05:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:05:33,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:33,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:33,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 18:05:34,166 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 18:05:34,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 78688591, now seen corresponding path program 1 times [2024-10-14 18:05:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000849338] [2024-10-14 18:05:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:34,168 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 18:05:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:34,169 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 18:05:34,170 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 18:05:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:34,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:05:34,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:34,305 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 18:05:34,357 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 18:05:34,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:34,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000849338] [2024-10-14 18:05:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000849338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:34,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226443096] [2024-10-14 18:05:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:34,361 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:34,638 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-14 18:05:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 18:05:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:34,639 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:05:34,639 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:05:34,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 18:05:34,640 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:34,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 153 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:05:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 18:05:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.76) internal successors, (88), 77 states have internal predecessors, (88), 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 18:05:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-10-14 18:05:34,643 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 9 [2024-10-14 18:05:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:34,644 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-10-14 18:05:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-10-14 18:05:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:05:34,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:34,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:34,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:34,845 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 18:05:34,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:34,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1481695607, now seen corresponding path program 1 times [2024-10-14 18:05:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021784472] [2024-10-14 18:05:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:34,847 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 18:05:34,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:34,849 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 18:05:34,850 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 18:05:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:34,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 18:05:34,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:34,923 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 11 treesize of output 7 [2024-10-14 18:05:34,929 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 11 treesize of output 7 [2024-10-14 18:05:34,995 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 18:05:34,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:34,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021784472] [2024-10-14 18:05:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021784472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:05:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274025873] [2024-10-14 18:05:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:34,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:34,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:34,998 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 18:05:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:35,413 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-10-14 18:05:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:35,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-10-14 18:05:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:35,414 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:05:35,415 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:05:35,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:35,415 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:35,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 241 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:05:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:05:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-14 18:05:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 78 states have internal predecessors, (89), 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 18:05:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-10-14 18:05:35,419 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2024-10-14 18:05:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:35,419 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-10-14 18:05:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 18:05:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-10-14 18:05:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:05:35,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:35,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:35,424 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 18:05:35,623 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 18:05:35,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:35,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1481755189, now seen corresponding path program 1 times [2024-10-14 18:05:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63779151] [2024-10-14 18:05:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:35,624 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 18:05:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:35,626 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 18:05:35,626 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 18:05:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:05:35,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:35,722 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 18:05:35,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:35,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:35,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63779151] [2024-10-14 18:05:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63779151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:35,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:35,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:05:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402850301] [2024-10-14 18:05:35,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:35,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:35,725 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18:05:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:35,878 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-10-14 18:05:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-14 18:05:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:35,879 INFO L225 Difference]: With dead ends: 81 [2024-10-14 18:05:35,879 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 18:05:35,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 18:05:35,880 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:35,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 18:05:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 18:05:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 80 states have internal predecessors, (91), 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 18:05:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-10-14 18:05:35,883 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 10 [2024-10-14 18:05:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:35,883 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-10-14 18:05:35,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18:05:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-10-14 18:05:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:05:35,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:35,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:35,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:36,084 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 18:05:36,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1310336530, now seen corresponding path program 1 times [2024-10-14 18:05:36,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:36,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767785926] [2024-10-14 18:05:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:36,086 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 18:05:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:36,087 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 18:05:36,088 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 18:05:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:36,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:05:36,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:36,167 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 18:05:36,202 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 18:05:36,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:36,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767785926] [2024-10-14 18:05:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767785926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325033739] [2024-10-14 18:05:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:36,204 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:36,543 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-10-14 18:05:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:36,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 18:05:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:36,544 INFO L225 Difference]: With dead ends: 116 [2024-10-14 18:05:36,544 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 18:05:36,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:36,545 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:36,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 149 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 18:05:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2024-10-14 18:05:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 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 18:05:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2024-10-14 18:05:36,548 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 11 [2024-10-14 18:05:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2024-10-14 18:05:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2024-10-14 18:05:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:05:36,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:36,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:36,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:36,749 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 18:05:36,750 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1310336529, now seen corresponding path program 1 times [2024-10-14 18:05:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913867589] [2024-10-14 18:05:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:36,751 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 18:05:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:36,752 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 18:05:36,753 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 18:05:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:36,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 18:05:36,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:36,830 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 18:05:36,924 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 18:05:36,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:36,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913867589] [2024-10-14 18:05:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913867589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367502836] [2024-10-14 18:05:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:36,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:36,926 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:37,290 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2024-10-14 18:05:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 18:05:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:37,291 INFO L225 Difference]: With dead ends: 133 [2024-10-14 18:05:37,292 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 18:05:37,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:37,292 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:37,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:05:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 18:05:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2024-10-14 18:05:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.7752808988764044) internal successors, (158), 115 states have internal predecessors, (158), 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 18:05:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-10-14 18:05:37,296 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 11 [2024-10-14 18:05:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:37,297 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-10-14 18:05:37,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-10-14 18:05:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:05:37,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:37,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:37,303 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 18:05:37,498 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 18:05:37,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1689676113, now seen corresponding path program 1 times [2024-10-14 18:05:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293552195] [2024-10-14 18:05:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:37,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:37,503 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 18:05:37,504 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 18:05:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 18:05:37,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:37,673 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 18:05:37,687 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 11 treesize of output 7 [2024-10-14 18:05:37,694 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 11 treesize of output 7 [2024-10-14 18:05:37,767 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:05:37,768 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 18:05:37,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:05:37,932 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 18:05:37,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:37,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293552195] [2024-10-14 18:05:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293552195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:05:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077041887] [2024-10-14 18:05:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:37,934 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:38,480 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-10-14 18:05:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:38,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 18:05:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:38,482 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:05:38,482 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:05:38,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:05:38,483 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:38,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 310 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:05:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:05:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-14 18:05:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.7263157894736842) internal successors, (164), 121 states have internal predecessors, (164), 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 18:05:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 164 transitions. [2024-10-14 18:05:38,487 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 164 transitions. Word has length 11 [2024-10-14 18:05:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:38,488 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 164 transitions. [2024-10-14 18:05:38,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 164 transitions. [2024-10-14 18:05:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:05:38,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:38,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:38,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:38,689 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 18:05:38,690 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash 968469505, now seen corresponding path program 1 times [2024-10-14 18:05:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230449512] [2024-10-14 18:05:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:38,691 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 18:05:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:38,694 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 18:05:38,695 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 18:05:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:38,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 18:05:38,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:38,801 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 11 treesize of output 7 [2024-10-14 18:05:38,808 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 11 treesize of output 7 [2024-10-14 18:05:38,925 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 18:05:38,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:38,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230449512] [2024-10-14 18:05:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230449512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:38,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:05:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850433276] [2024-10-14 18:05:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:05:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:05:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:05:38,927 INFO L87 Difference]: Start difference. First operand 122 states and 164 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 18:05:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:39,298 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2024-10-14 18:05:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:05:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-10-14 18:05:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:39,302 INFO L225 Difference]: With dead ends: 133 [2024-10-14 18:05:39,303 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 18:05:39,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:39,303 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 20 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:39,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 281 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 18:05:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2024-10-14 18:05:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 121 states have internal predecessors, (163), 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 18:05:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-10-14 18:05:39,307 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 16 [2024-10-14 18:05:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:39,307 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-10-14 18:05:39,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 18:05:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-10-14 18:05:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:05:39,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:39,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:39,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 18:05:39,510 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 18:05:39,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 970316547, now seen corresponding path program 1 times [2024-10-14 18:05:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86467203] [2024-10-14 18:05:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:39,511 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 18:05:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:39,512 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 18:05:39,514 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 18:05:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:39,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:05:39,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:39,613 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 18:05:39,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:39,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86467203] [2024-10-14 18:05:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86467203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:39,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:05:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534030448] [2024-10-14 18:05:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:39,615 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18:05:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:39,769 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2024-10-14 18:05:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:05:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-10-14 18:05:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:39,770 INFO L225 Difference]: With dead ends: 114 [2024-10-14 18:05:39,770 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 18:05:39,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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 18:05:39,770 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:39,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 236 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 18:05:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2024-10-14 18:05:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 107 states have internal predecessors, (124), 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 18:05:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2024-10-14 18:05:39,774 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 16 [2024-10-14 18:05:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:39,774 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2024-10-14 18:05:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18:05:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2024-10-14 18:05:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:05:39,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:39,775 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:39,780 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 18:05:39,975 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 18:05:39,975 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1192319781, now seen corresponding path program 1 times [2024-10-14 18:05:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591101892] [2024-10-14 18:05:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:39,976 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 18:05:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:39,978 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 18:05:39,978 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 18:05:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:40,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:05:40,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:40,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:40,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591101892] [2024-10-14 18:05:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591101892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:40,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:05:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507298750] [2024-10-14 18:05:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:40,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:05:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:05:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:05:40,183 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18:05:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:40,398 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2024-10-14 18:05:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-10-14 18:05:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:40,399 INFO L225 Difference]: With dead ends: 107 [2024-10-14 18:05:40,399 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 18:05:40,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:40,400 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:40,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 18:05:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 18:05:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 106 states have internal predecessors, (123), 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 18:05:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2024-10-14 18:05:40,403 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 16 [2024-10-14 18:05:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:40,404 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2024-10-14 18:05:40,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18:05:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2024-10-14 18:05:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:05:40,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:40,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:40,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 18:05:40,605 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 18:05:40,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 466490406, now seen corresponding path program 1 times [2024-10-14 18:05:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849773337] [2024-10-14 18:05:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:40,608 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 18:05:40,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:40,611 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 18:05:40,612 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 18:05:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:40,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:05:40,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:40,805 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 18:05:40,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:40,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849773337] [2024-10-14 18:05:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849773337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:05:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448043765] [2024-10-14 18:05:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:40,807 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18:05:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:40,981 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-10-14 18:05:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:40,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-10-14 18:05:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:40,982 INFO L225 Difference]: With dead ends: 106 [2024-10-14 18:05:40,982 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 18:05:40,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:05:40,983 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 59 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:40,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 18:05:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-14 18:05:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 105 states have internal predecessors, (121), 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 18:05:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2024-10-14 18:05:40,986 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 18 [2024-10-14 18:05:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:40,986 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2024-10-14 18:05:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18:05:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2024-10-14 18:05:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:40,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:40,987 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] [2024-10-14 18:05:40,993 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 (22)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:41,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:41,188 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:41,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1620688724, now seen corresponding path program 1 times [2024-10-14 18:05:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:41,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424516392] [2024-10-14 18:05:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:41,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 18:05:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:41,190 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:41,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 18:05:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:41,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:05:41,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:41,442 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~head#1.base_17| (_ BitVec 64))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_17| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_17|)))) is different from true [2024-10-14 18:05:41,442 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 18:05:41,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:41,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424516392] [2024-10-14 18:05:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424516392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:05:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758675223] [2024-10-14 18:05:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:05:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:05:41,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-14 18:05:41,444 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18:05:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:41,905 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-10-14 18:05:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:05:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-10-14 18:05:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:41,907 INFO L225 Difference]: With dead ends: 109 [2024-10-14 18:05:41,907 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:05:41,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-14 18:05:41,907 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:41,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 97 Unchecked, 0.4s Time] [2024-10-14 18:05:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:05:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 18:05:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 92 states have internal predecessors, (107), 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 18:05:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-14 18:05:41,913 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2024-10-14 18:05:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:41,913 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-14 18:05:41,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 18:05:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-14 18:05:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:41,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:41,914 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:41,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-14 18:05:42,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:42,115 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:42,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1648057858, now seen corresponding path program 1 times [2024-10-14 18:05:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:42,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792667148] [2024-10-14 18:05:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:42,116 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 18:05:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:42,117 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:42,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 18:05:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:42,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:05:42,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:42,364 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 18:05:42,396 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 18:05:42,397 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 18:05:42,555 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 11 treesize of output 7 [2024-10-14 18:05:42,601 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:05:42,601 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 36 treesize of output 35 [2024-10-14 18:05:42,685 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 27 treesize of output 15 [2024-10-14 18:05:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:42,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:42,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792667148] [2024-10-14 18:05:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792667148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:42,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:05:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943055065] [2024-10-14 18:05:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:05:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:42,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:05:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:05:42,817 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 18:05:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:43,625 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2024-10-14 18:05:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:05:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 20 [2024-10-14 18:05:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:43,627 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:05:43,627 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:05:43,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-14 18:05:43,627 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:43,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 351 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:05:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:05:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 18:05:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 94 states have internal predecessors, (111), 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 18:05:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2024-10-14 18:05:43,630 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 20 [2024-10-14 18:05:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2024-10-14 18:05:43,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 18:05:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2024-10-14 18:05:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:43,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:43,631 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:43,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-10-14 18:05:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:43,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:43,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1648057859, now seen corresponding path program 1 times [2024-10-14 18:05:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096057548] [2024-10-14 18:05:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:43,833 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 18:05:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:43,834 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:43,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-14 18:05:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:44,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 18:05:44,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:44,024 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 18:05:44,039 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 18:05:44,050 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:05:44,051 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 18:05:44,181 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 11 treesize of output 7 [2024-10-14 18:05:44,192 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 11 treesize of output 7 [2024-10-14 18:05:44,245 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:05:44,246 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 50 treesize of output 45 [2024-10-14 18:05:44,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-10-14 18:05:44,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 25 treesize of output 13 [2024-10-14 18:05:44,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-14 18:05:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:44,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:45,097 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_552 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_hlist_add_head_~n#1.base| v_ArrVal_551) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_hlist_add_head_~n#1.base| v_ArrVal_552) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (forall ((v_ArrVal_551 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_hlist_add_head_~n#1.base| v_ArrVal_551) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv8 64) .cse0))))) is different from false [2024-10-14 18:05:45,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:45,129 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2024-10-14 18:05:45,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:45,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 39 [2024-10-14 18:05:45,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 5 [2024-10-14 18:05:45,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:45,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-14 18:05:45,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:45,209 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-14 18:05:45,214 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:05:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-14 18:05:45,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:05:45,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-14 18:05:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:45,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:45,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096057548] [2024-10-14 18:05:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096057548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:45,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-14 18:05:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371534876] [2024-10-14 18:05:45,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 18:05:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 18:05:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=265, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:05:45,739 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 18:05:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:47,908 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-10-14 18:05:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:05:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 20 [2024-10-14 18:05:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:47,909 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:05:47,909 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:05:47,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=431, Unknown=1, NotChecked=42, Total=552 [2024-10-14 18:05:47,910 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:47,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 561 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 503 Invalid, 0 Unknown, 48 Unchecked, 1.9s Time] [2024-10-14 18:05:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:05:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 18:05:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 94 states have internal predecessors, (110), 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 18:05:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-10-14 18:05:47,913 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 20 [2024-10-14 18:05:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:47,913 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-14 18:05:47,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 18:05:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-10-14 18:05:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:05:47,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:47,914 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:47,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-14 18:05:48,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:48,115 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -449921086, now seen corresponding path program 1 times [2024-10-14 18:05:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546850947] [2024-10-14 18:05:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:48,116 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 18:05:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:48,117 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-14 18:05:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:48,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:05:48,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:05:48,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:48,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546850947] [2024-10-14 18:05:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546850947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:05:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700842999] [2024-10-14 18:05:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:05:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:05:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:05:48,271 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 18:05:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:48,389 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2024-10-14 18:05:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:05:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:05:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:48,390 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:05:48,390 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 18:05:48,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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 18:05:48,391 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:48,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 18:05:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 18:05:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 94 states have internal predecessors, (109), 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 18:05:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-10-14 18:05:48,393 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 21 [2024-10-14 18:05:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:48,394 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-10-14 18:05:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 18:05:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-10-14 18:05:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:05:48,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:48,394 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:48,401 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 (26)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:48,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:48,595 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash -448074044, now seen corresponding path program 1 times [2024-10-14 18:05:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367032056] [2024-10-14 18:05:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:48,596 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 18:05:48,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:48,598 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:48,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-14 18:05:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:48,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:05:48,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:48,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:48,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:48,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367032056] [2024-10-14 18:05:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367032056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:48,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:05:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622942543] [2024-10-14 18:05:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:48,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:05:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:05:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:48,858 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:49,178 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-14 18:05:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:05:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:05:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:49,179 INFO L225 Difference]: With dead ends: 93 [2024-10-14 18:05:49,179 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:05:49,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:49,180 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:49,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 166 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:05:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:05:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 18:05:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 92 states have internal predecessors, (106), 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 18:05:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-10-14 18:05:49,183 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 21 [2024-10-14 18:05:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:49,183 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-10-14 18:05:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:05:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-10-14 18:05:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:05:49,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:49,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:49,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-10-14 18:05:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:05:49,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -827413628, now seen corresponding path program 1 times [2024-10-14 18:05:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027018450] [2024-10-14 18:05:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:49,386 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 18:05:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:49,389 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:05:49,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-14 18:05:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:49,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 18:05:49,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:49,702 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 18:05:49,724 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 18:05:49,725 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 18:05:49,836 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 11 treesize of output 7 [2024-10-14 18:05:49,874 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:05:49,874 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 36 treesize of output 35 [2024-10-14 18:05:49,950 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-10-14 18:05:49,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-10-14 18:05:50,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2024-10-14 18:05:50,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2024-10-14 18:05:50,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2024-10-14 18:05:50,121 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 27 treesize of output 15 [2024-10-14 18:05:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:50,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:50,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_761 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_INIT_HLIST_NODE_~h#1.base| v_ArrVal_760) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|))))) is different from false [2024-10-14 18:05:50,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_29| (_ BitVec 64)) (v_ArrVal_758 (_ BitVec 1)) (v_ArrVal_761 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_29|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_29| v_ArrVal_758) (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~ptr~0#1.base_29| v_ArrVal_761) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-10-14 18:05:50,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_29| (_ BitVec 64)) (v_ArrVal_758 (_ BitVec 1)) (v_ArrVal_761 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_29| v_ArrVal_758) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_hlist_add_head_~n#1.base| v_ArrVal_757) |v_ULTIMATE.start_create_~ptr~0#1.base_29| v_ArrVal_761) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_29|))))) is different from false [2024-10-14 18:05:50,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:50,306 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-14 18:05:50,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:50,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 91 [2024-10-14 18:05:50,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 72 [2024-10-14 18:05:50,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 34 [2024-10-14 18:05:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 18:05:57,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:05:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027018450] [2024-10-14 18:05:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027018450] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:57,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:57,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-10-14 18:05:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578771695] [2024-10-14 18:05:57,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:57,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 18:05:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:05:57,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 18:05:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=215, Unknown=9, NotChecked=96, Total=380 [2024-10-14 18:05:57,308 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:05:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:59,406 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-14 18:05:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:05:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:05:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:59,408 INFO L225 Difference]: With dead ends: 93 [2024-10-14 18:05:59,408 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:05:59,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=112, Invalid=353, Unknown=9, NotChecked=126, Total=600 [2024-10-14 18:05:59,409 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:59,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 482 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 144 Unchecked, 1.8s Time] [2024-10-14 18:05:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:05:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-14 18:05:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.5) internal successors, (105), 91 states have internal predecessors, (105), 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 18:05:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-14 18:05:59,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 21 [2024-10-14 18:05:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-14 18:05:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:05:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-14 18:05:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:05:59,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:59,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:59,424 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 (28)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 18:05:59,613 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:05:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -827413627, now seen corresponding path program 1 times [2024-10-14 18:05:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:05:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616585987] [2024-10-14 18:05:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:59,614 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 18:05:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:05:59,618 INFO L229 MonitoredProcess]: Starting monitored process 29 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 18:05:59,619 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 (29)] Waiting until timeout for monitored process [2024-10-14 18:05:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:59,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 18:05:59,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:59,932 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 18:05:59,962 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 18:05:59,963 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 18:05:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-14 18:06:00,176 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 11 treesize of output 7 [2024-10-14 18:06:00,192 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 11 treesize of output 7 [2024-10-14 18:06:00,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:06:00,248 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 61 treesize of output 54 [2024-10-14 18:06:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-10-14 18:06:00,329 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-14 18:06:00,330 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-14 18:06:00,363 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-14 18:06:00,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-10-14 18:06:00,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2024-10-14 18:06:00,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2024-10-14 18:06:00,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:06:00,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2024-10-14 18:06:00,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 18:06:00,587 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 25 treesize of output 13 [2024-10-14 18:06:00,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-14 18:06:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:06:00,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:06:00,840 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_866 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_866) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 64) .cse0) (bvadd (_ bv16 64) .cse0)))) (forall ((v_ArrVal_866 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_865 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv16 64) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_866) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_create_~head~0#1.base|) |c_ULTIMATE.start_create_~head~0#1.offset|))))) is different from false [2024-10-14 18:06:03,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:03,581 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2024-10-14 18:06:03,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:03,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 174 treesize of output 165 [2024-10-14 18:06:03,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 28 [2024-10-14 18:06:03,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 [2024-10-14 18:06:04,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:04,043 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-10-14 18:06:04,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:04,070 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-14 18:06:04,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 128 treesize of output 131 [2024-10-14 18:06:04,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 766 treesize of output 741 [2024-10-14 18:06:04,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 78 [2024-10-14 18:06:04,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 74 [2024-10-14 18:06:04,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 36 [2024-10-14 18:06:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 34 [2024-10-14 18:06:15,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:06:15,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 290 treesize of output 331 [2024-10-14 18:06:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:06:29,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:06:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616585987] [2024-10-14 18:06:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616585987] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:06:29,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:06:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-10-14 18:06:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895982012] [2024-10-14 18:06:29,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:06:29,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 18:06:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:06:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 18:06:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=276, Unknown=10, NotChecked=34, Total=380 [2024-10-14 18:06:29,808 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:06:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:06:39,781 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-14 18:06:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:06:39,794 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 18:06:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:06:39,795 INFO L225 Difference]: With dead ends: 92 [2024-10-14 18:06:39,795 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 18:06:39,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=119, Invalid=427, Unknown=10, NotChecked=44, Total=600 [2024-10-14 18:06:39,796 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 26 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:06:39,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 449 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 393 Invalid, 0 Unknown, 45 Unchecked, 8.6s Time] [2024-10-14 18:06:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 18:06:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-10-14 18:06:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 90 states have internal predecessors, (104), 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 18:06:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-14 18:06:39,803 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 21 [2024-10-14 18:06:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:06:39,803 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-14 18:06:39,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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 18:06:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-14 18:06:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:06:39,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:06:39,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:06:39,817 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 (29)] Forceful destruction successful, exit code 0 [2024-10-14 18:06:40,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 18:06:40,005 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-10-14 18:06:40,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:06:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash -3451379, now seen corresponding path program 1 times [2024-10-14 18:06:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:06:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676602148] [2024-10-14 18:06:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:06:40,006 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 18:06:40,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:06:40,008 INFO L229 MonitoredProcess]: Starting monitored process 30 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 18:06:40,009 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 (30)] Waiting until timeout for monitored process [2024-10-14 18:06:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:06:40,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 18:06:40,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:06:40,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 7 [2024-10-14 18:06:40,255 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 11 treesize of output 7 [2024-10-14 18:06:40,268 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 11 treesize of output 7 [2024-10-14 18:06:40,343 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:06:40,344 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 18:06:40,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-14 18:06:40,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-10-14 18:06:40,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-10-14 18:06:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 18:06:40,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 18:06:41,064 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-10-14 18:06:41,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 70 [2024-10-14 18:06:41,134 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-14 18:06:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65