./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/linux-list-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/linux-list-lst-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 4ccf2c6cbb7828d48e51abf8a05e6b57c732fac1f8d9fff9fd3d0e0c2919368a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:51:06,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:51:06,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:51:06,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:51:06,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:51:06,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:51:06,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:51:06,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:51:06,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:51:06,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:51:06,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:51:06,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:51:06,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:51:06,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:51:06,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:51:06,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:51:06,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:51:06,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:51:06,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:51:06,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:51:06,143 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:51:06,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:51:06,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:51:06,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:51:06,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:51:06,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:51:06,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:51:06,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:51:06,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:51:06,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:51:06,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:51:06,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:51:06,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:51:06,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:51:06,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:51:06,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:51:06,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:51:06,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:51:06,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:51:06,150 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 -> 4ccf2c6cbb7828d48e51abf8a05e6b57c732fac1f8d9fff9fd3d0e0c2919368a [2024-11-22 18:51:06,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:51:06,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:51:06,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:51:06,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:51:06,406 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:51:06,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/linux-list-lst-data.i [2024-11-22 18:51:07,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:51:08,028 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:51:08,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-list-lst-data.i [2024-11-22 18:51:08,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56955578/0bf91ea994234d0b8228c9d26d0d9a10/FLAG634430b48 [2024-11-22 18:51:08,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56955578/0bf91ea994234d0b8228c9d26d0d9a10 [2024-11-22 18:51:08,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:51:08,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:51:08,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:51:08,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:51:08,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:51:08,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:51:08" (1/1) ... [2024-11-22 18:51:08,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c1c6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:08, skipping insertion in model container [2024-11-22 18:51:08,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:51:08" (1/1) ... [2024-11-22 18:51:08,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:51:08,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:51:08,456 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 18:51:08,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1552ba61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:08, skipping insertion in model container [2024-11-22 18:51:08,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:51:08,458 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:51:08,459 INFO L158 Benchmark]: Toolchain (without parser) took 395.08ms. Allocated memory is still 169.9MB. Free memory was 94.6MB in the beginning and 132.2MB in the end (delta: -37.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-22 18:51:08,459 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:51:08,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.36ms. Allocated memory is still 169.9MB. Free memory was 94.5MB in the beginning and 132.2MB in the end (delta: -37.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-22 18:51:08,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.36ms. Allocated memory is still 169.9MB. Free memory was 94.5MB in the beginning and 132.2MB in the end (delta: -37.7MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2490]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/linux-list-lst-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 4ccf2c6cbb7828d48e51abf8a05e6b57c732fac1f8d9fff9fd3d0e0c2919368a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:51:10,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:51:10,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-11-22 18:51:10,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:51:10,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:51:10,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:51:10,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:51:10,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:51:10,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:51:10,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:51:10,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:51:10,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:51:10,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:51:10,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:51:10,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:51:10,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:51:10,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:51:10,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:51:10,468 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:51:10,468 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:51:10,469 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:51:10,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:51:10,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:51:10,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:51:10,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:51:10,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:51:10,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:51:10,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:51:10,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:51:10,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:51:10,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:51:10,476 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 -> 4ccf2c6cbb7828d48e51abf8a05e6b57c732fac1f8d9fff9fd3d0e0c2919368a [2024-11-22 18:51:10,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:51:10,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:51:10,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:51:10,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:51:10,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:51:10,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/linux-list-lst-data.i [2024-11-22 18:51:12,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:51:12,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:51:12,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/linux-list-lst-data.i [2024-11-22 18:51:12,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f969538/b1697b05d0f04378b8a26f5fad05fad8/FLAG125fe32ed [2024-11-22 18:51:12,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f969538/b1697b05d0f04378b8a26f5fad05fad8 [2024-11-22 18:51:12,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:51:12,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:51:12,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:51:12,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:51:12,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:51:12,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:12,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72553386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12, skipping insertion in model container [2024-11-22 18:51:12,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:12,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:51:12,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:51:12,823 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:51:12,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:51:12,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:51:12,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:51:12,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:51:12,937 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:51:12,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12 WrapperNode [2024-11-22 18:51:12,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:51:12,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:51:12,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:51:12,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:51:12,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:12,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:12,996 INFO L138 Inliner]: procedures = 125, calls = 33, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 102 [2024-11-22 18:51:13,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:51:13,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:51:13,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:51:13,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:51:13,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,057 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 11 writes are split as follows [11]. [2024-11-22 18:51:13,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:51:13,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:51:13,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:51:13,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:51:13,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (1/1) ... [2024-11-22 18:51:13,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:51:13,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:51:13,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:51:13,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:51:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:51:13,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:51:13,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:51:13,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:51:13,758 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-22 18:51:13,758 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:51:13,769 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:51:13,769 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 18:51:13,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:51:13 BoogieIcfgContainer [2024-11-22 18:51:13,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:51:13,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:51:13,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:51:13,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:51:13,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:51:12" (1/3) ... [2024-11-22 18:51:13,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e728960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:51:13, skipping insertion in model container [2024-11-22 18:51:13,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:51:12" (2/3) ... [2024-11-22 18:51:13,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e728960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:51:13, skipping insertion in model container [2024-11-22 18:51:13,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:51:13" (3/3) ... [2024-11-22 18:51:13,776 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-list-lst-data.i [2024-11-22 18:51:13,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:51:13,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-22 18:51:13,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:51:13,828 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;@10ec9b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:51:13,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-22 18:51:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 52 states have (on average 2.019230769230769) internal successors, (105), 97 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-11-22 18:51:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:51:13,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:13,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:51:13,838 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-11-22 18:51:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-22 18:51:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665537262] [2024-11-22 18:51:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:13,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:13,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:13,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:13,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 18:51:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:13,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:51:13,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:13,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:13,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:13,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665537262] [2024-11-22 18:51:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665537262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:51:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334464780] [2024-11-22 18:51:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:13,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:51:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:51:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:14,012 INFO L87 Difference]: Start difference. First operand has 98 states, 52 states have (on average 2.019230769230769) internal successors, (105), 97 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:14,156 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2024-11-22 18:51:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:51:14,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 18:51:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:14,164 INFO L225 Difference]: With dead ends: 96 [2024-11-22 18:51:14,164 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 18:51:14,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:14,167 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 27 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:14,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 115 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:51:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 18:51:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-22 18:51:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 93 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-11-22 18:51:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2024-11-22 18:51:14,191 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 3 [2024-11-22 18:51:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:14,191 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2024-11-22 18:51:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2024-11-22 18:51:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:51:14,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:14,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:51:14,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 18:51:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:14,394 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-11-22 18:51:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2024-11-22 18:51:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88372275] [2024-11-22 18:51:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:14,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:14,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 18:51:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:14,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:51:14,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:14,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:14,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:14,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:14,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88372275] [2024-11-22 18:51:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88372275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:51:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292126873] [2024-11-22 18:51:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:14,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:51:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:51:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:14,484 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:14,741 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2024-11-22 18:51:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:51:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-22 18:51:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:14,743 INFO L225 Difference]: With dead ends: 95 [2024-11-22 18:51:14,743 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 18:51:14,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:14,744 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:14,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 18:51:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-22 18:51:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 91 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-11-22 18:51:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2024-11-22 18:51:14,749 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 3 [2024-11-22 18:51:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2024-11-22 18:51:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2024-11-22 18:51:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:51:14,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:14,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:14,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 18:51:14,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:14,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:14,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 148109360, now seen corresponding path program 1 times [2024-11-22 18:51:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905165824] [2024-11-22 18:51:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:14,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:14,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:14,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:14,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 18:51:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:15,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:51:15,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:15,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:15,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:15,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905165824] [2024-11-22 18:51:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905165824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:15,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:51:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495128568] [2024-11-22 18:51:15,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:15,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:51:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:51:15,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:15,020 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:15,140 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2024-11-22 18:51:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:51:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:15,141 INFO L225 Difference]: With dead ends: 91 [2024-11-22 18:51:15,141 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 18:51:15,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:15,142 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:15,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:51:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 18:51:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-22 18:51:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 90 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-11-22 18:51:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2024-11-22 18:51:15,148 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 8 [2024-11-22 18:51:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:15,148 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2024-11-22 18:51:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2024-11-22 18:51:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:51:15,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:15,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:15,159 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:51:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:15,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:15,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 148109361, now seen corresponding path program 1 times [2024-11-22 18:51:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617636620] [2024-11-22 18:51:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:15,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:15,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:15,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:15,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 18:51:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:15,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:51:15,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:15,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:15,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617636620] [2024-11-22 18:51:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617636620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:51:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558636043] [2024-11-22 18:51:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:51:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:15,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:51:15,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:15,417 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:15,591 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-22 18:51:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:51:15,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:15,592 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:51:15,592 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:51:15,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:51:15,593 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:15,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:51:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 18:51:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.803921568627451) internal successors, (92), 89 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-11-22 18:51:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2024-11-22 18:51:15,597 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 8 [2024-11-22 18:51:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:15,598 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2024-11-22 18:51:15,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) 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-11-22 18:51:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2024-11-22 18:51:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:51:15,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:15,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:15,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:51:15,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:15,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:15,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 599141454, now seen corresponding path program 1 times [2024-11-22 18:51:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786389296] [2024-11-22 18:51:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:15,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:15,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:15,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 18:51:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:15,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:51:15,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:15,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:15,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:15,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786389296] [2024-11-22 18:51:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786389296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:51:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830016039] [2024-11-22 18:51:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:51:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:51:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:15,885 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:16,104 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2024-11-22 18:51:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:51:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:16,114 INFO L225 Difference]: With dead ends: 89 [2024-11-22 18:51:16,115 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:51:16,117 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-11-22 18:51:16,118 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 181 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:16,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 181 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:51:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-22 18:51:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 88 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-11-22 18:51:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2024-11-22 18:51:16,126 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 10 [2024-11-22 18:51:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:16,126 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2024-11-22 18:51:16,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2024-11-22 18:51:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:51:16,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:16,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:16,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 18:51:16,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:16,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 599141455, now seen corresponding path program 1 times [2024-11-22 18:51:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69901151] [2024-11-22 18:51:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:16,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:16,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 18:51:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:16,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:51:16,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:16,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:16,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:16,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69901151] [2024-11-22 18:51:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69901151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:51:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528613193] [2024-11-22 18:51:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:16,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:51:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:51:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:16,467 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:16,755 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-22 18:51:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:51:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:16,757 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:51:16,757 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:51:16,757 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-11-22 18:51:16,757 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:16,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 228 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:51:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:51:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2024-11-22 18:51:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 93 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-11-22 18:51:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2024-11-22 18:51:16,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 10 [2024-11-22 18:51:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:16,762 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-11-22 18:51:16,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2024-11-22 18:51:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:51:16,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:16,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:16,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 18:51:16,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:16,964 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-11-22 18:51:16,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash 599174257, now seen corresponding path program 1 times [2024-11-22 18:51:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173562736] [2024-11-22 18:51:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:16,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:16,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:16,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:16,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 18:51:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:17,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:51:17,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:17,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-11-22 18:51:17,158 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 18:51:17,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-22 18:51:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:17,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:17,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173562736] [2024-11-22 18:51:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173562736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:51:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63199846] [2024-11-22 18:51:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:17,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:51:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:51:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:51:17,179 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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-11-22 18:51:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:17,361 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2024-11-22 18:51:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:51:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-11-22 18:51:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:17,362 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:51:17,362 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 18:51:17,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:17,363 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:17,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 152 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 18:51:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 18:51:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 92 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-11-22 18:51:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2024-11-22 18:51:17,366 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 10 [2024-11-22 18:51:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:17,366 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2024-11-22 18:51:17,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-11-22 18:51:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2024-11-22 18:51:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:51:17,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:17,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:17,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 18:51:17,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:17,571 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-11-22 18:51:17,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 599174258, now seen corresponding path program 1 times [2024-11-22 18:51:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481474754] [2024-11-22 18:51:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:17,575 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:17,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:51:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:17,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:51:17,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:17,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:17,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:51:17,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:51:17,838 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:51:17,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:51:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:17,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:17,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:17,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481474754] [2024-11-22 18:51:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481474754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:51:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087401801] [2024-11-22 18:51:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:51:17,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:51:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:17,876 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:18,136 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2024-11-22 18:51:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:51:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:18,137 INFO L225 Difference]: With dead ends: 92 [2024-11-22 18:51:18,137 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 18:51:18,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-22 18:51:18,137 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:18,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 154 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 18:51:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 18:51:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 91 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2024-11-22 18:51:18,140 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 10 [2024-11-22 18:51:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:18,141 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2024-11-22 18:51:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-11-22 18:51:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2024-11-22 18:51:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:51:18,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:18,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:18,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 18:51:18,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:18,346 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-11-22 18:51:18,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 280843506, now seen corresponding path program 1 times [2024-11-22 18:51:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108007366] [2024-11-22 18:51:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:18,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:18,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:18,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:18,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 18:51:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:18,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:51:18,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:18,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:18,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108007366] [2024-11-22 18:51:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108007366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:51:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708076315] [2024-11-22 18:51:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:18,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:51:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:51:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:51:18,445 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:18,594 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-22 18:51:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:51:18,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-22 18:51:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:18,595 INFO L225 Difference]: With dead ends: 91 [2024-11-22 18:51:18,595 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 18:51:18,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:51:18,596 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:18,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:51:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 18:51:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-22 18:51:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 90 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-11-22 18:51:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2024-11-22 18:51:18,599 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 12 [2024-11-22 18:51:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:18,599 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2024-11-22 18:51:18,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2024-11-22 18:51:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:51:18,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:18,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:18,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 18:51:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:18,800 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-11-22 18:51:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 280843507, now seen corresponding path program 1 times [2024-11-22 18:51:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270903185] [2024-11-22 18:51:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:18,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:18,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:18,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:18,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 18:51:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:18,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:51:18,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:18,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:18,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270903185] [2024-11-22 18:51:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270903185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:51:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970157982] [2024-11-22 18:51:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:18,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:51:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:51:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:51:18,987 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:19,198 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-11-22 18:51:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:51:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-22 18:51:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:19,199 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:51:19,199 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:51:19,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:51:19,200 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:19,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 264 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:51:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 18:51:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 89 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-11-22 18:51:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2024-11-22 18:51:19,203 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 12 [2024-11-22 18:51:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2024-11-22 18:51:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2024-11-22 18:51:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:51:19,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:19,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:19,217 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-11-22 18:51:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:19,408 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-11-22 18:51:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 116214104, now seen corresponding path program 1 times [2024-11-22 18:51:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988928216] [2024-11-22 18:51:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:19,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:19,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:19,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 18:51:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:19,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:51:19,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:19,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:19,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:19,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:19,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988928216] [2024-11-22 18:51:19,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988928216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:19,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:51:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284646749] [2024-11-22 18:51:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:19,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:51:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:51:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:19,546 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:19,773 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-22 18:51:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:51:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 18:51:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:19,774 INFO L225 Difference]: With dead ends: 88 [2024-11-22 18:51:19,774 INFO L226 Difference]: Without dead ends: 88 [2024-11-22 18:51:19,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-22 18:51:19,775 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:19,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 198 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:51:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-22 18:51:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-22 18:51:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.625) internal successors, (91), 87 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-11-22 18:51:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-22 18:51:19,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 13 [2024-11-22 18:51:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-22 18:51:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-22 18:51:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:51:19,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:19,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:19,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:51:19,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:19,981 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-11-22 18:51:19,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash 116214105, now seen corresponding path program 1 times [2024-11-22 18:51:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640487417] [2024-11-22 18:51:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:19,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:19,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:19,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 18:51:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:20,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:51:20,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:20,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:20,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:20,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640487417] [2024-11-22 18:51:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640487417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:51:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726805213] [2024-11-22 18:51:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:20,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:51:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:51:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:51:20,195 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:20,506 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-22 18:51:20,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:51:20,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 18:51:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:20,507 INFO L225 Difference]: With dead ends: 86 [2024-11-22 18:51:20,507 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 18:51:20,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-22 18:51:20,507 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:20,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:51:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 18:51:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-22 18:51:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 85 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-11-22 18:51:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-22 18:51:20,509 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 13 [2024-11-22 18:51:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-22 18:51:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-22 18:51:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:51:20,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:20,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:20,516 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-11-22 18:51:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:20,711 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-11-22 18:51:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -921012683, now seen corresponding path program 1 times [2024-11-22 18:51:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015849134] [2024-11-22 18:51:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:20,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:20,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:20,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:20,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 18:51:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:20,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:51:20,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:20,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:20,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:20,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:20,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015849134] [2024-11-22 18:51:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015849134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:20,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:20,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:51:20,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116391345] [2024-11-22 18:51:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:20,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:51:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:51:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:51:20,929 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:21,321 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2024-11-22 18:51:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:51:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:51:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:21,322 INFO L225 Difference]: With dead ends: 117 [2024-11-22 18:51:21,322 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 18:51:21,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:51:21,325 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:21,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 168 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:51:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 18:51:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2024-11-22 18:51:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 88 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2024-11-22 18:51:21,331 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 14 [2024-11-22 18:51:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2024-11-22 18:51:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2024-11-22 18:51:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:51:21,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:21,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:21,336 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-11-22 18:51:21,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:21,534 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:21,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash -921012682, now seen corresponding path program 1 times [2024-11-22 18:51:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844352903] [2024-11-22 18:51:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:21,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:21,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:21,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:21,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 18:51:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:21,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:51:21,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:21,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:21,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:21,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844352903] [2024-11-22 18:51:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844352903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:21,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:21,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:51:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227667200] [2024-11-22 18:51:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:21,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:51:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:51:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:51:21,780 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:22,156 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2024-11-22 18:51:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:51:22,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:51:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:22,157 INFO L225 Difference]: With dead ends: 139 [2024-11-22 18:51:22,157 INFO L226 Difference]: Without dead ends: 139 [2024-11-22 18:51:22,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:51:22,158 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:22,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 217 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:51:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-22 18:51:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-22 18:51:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 117 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2024-11-22 18:51:22,160 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 14 [2024-11-22 18:51:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:22,161 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2024-11-22 18:51:22,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2024-11-22 18:51:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:51:22,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:22,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:22,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 18:51:22,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:22,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:22,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash -921011048, now seen corresponding path program 1 times [2024-11-22 18:51:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618312578] [2024-11-22 18:51:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:22,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:22,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:22,365 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:22,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:51:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:22,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:51:22,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:22,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:22,447 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-11-22 18:51:22,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:51:22,518 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 15 treesize of output 7 [2024-11-22 18:51:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:22,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:22,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:22,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618312578] [2024-11-22 18:51:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618312578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:51:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845661487] [2024-11-22 18:51:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:22,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:51:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:51:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:51:22,545 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:22,965 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2024-11-22 18:51:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:51:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:51:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:22,966 INFO L225 Difference]: With dead ends: 124 [2024-11-22 18:51:22,966 INFO L226 Difference]: Without dead ends: 124 [2024-11-22 18:51:22,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:51:22,967 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 27 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:22,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 248 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:51:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-22 18:51:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2024-11-22 18:51:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.6630434782608696) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2024-11-22 18:51:22,969 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 14 [2024-11-22 18:51:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:22,969 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2024-11-22 18:51:22,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2024-11-22 18:51:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:51:22,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:22,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:22,974 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-11-22 18:51:23,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:23,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:23,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash -921011047, now seen corresponding path program 1 times [2024-11-22 18:51:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95868694] [2024-11-22 18:51:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:23,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:23,174 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:23,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 18:51:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:23,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:51:23,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:23,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:51:23,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-11-22 18:51:23,271 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 19 treesize of output 18 [2024-11-22 18:51:23,279 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 23 treesize of output 11 [2024-11-22 18:51:23,391 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 15 treesize of output 7 [2024-11-22 18:51:23,397 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:51:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:23,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:23,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95868694] [2024-11-22 18:51:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95868694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:23,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:51:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440248514] [2024-11-22 18:51:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:51:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:51:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:51:23,451 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:23,856 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2024-11-22 18:51:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:51:23,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-22 18:51:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:23,857 INFO L225 Difference]: With dead ends: 116 [2024-11-22 18:51:23,857 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 18:51:23,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:51:23,858 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 21 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:23,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 388 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:51:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 18:51:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-22 18:51:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 114 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2024-11-22 18:51:23,861 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 14 [2024-11-22 18:51:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2024-11-22 18:51:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2024-11-22 18:51:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:51:23,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:23,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:23,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 18:51:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:24,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:24,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash 12604668, now seen corresponding path program 1 times [2024-11-22 18:51:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:24,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798226655] [2024-11-22 18:51:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:24,067 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:24,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-22 18:51:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:24,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 18:51:24,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:24,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:24,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:24,252 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-11-22 18:51:24,259 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-11-22 18:51:24,321 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:51:24,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:51:24,342 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:51:24,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:51:24,369 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-11-22 18:51:24,375 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-11-22 18:51:24,426 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 15 treesize of output 7 [2024-11-22 18:51:24,430 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 7 treesize of output 3 [2024-11-22 18:51:24,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-11-22 18:51:24,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:24,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798226655] [2024-11-22 18:51:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798226655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:51:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658720920] [2024-11-22 18:51:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:51:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:51:24,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:51:24,497 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:25,147 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2024-11-22 18:51:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:51:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 18:51:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:25,148 INFO L225 Difference]: With dead ends: 123 [2024-11-22 18:51:25,148 INFO L226 Difference]: Without dead ends: 123 [2024-11-22 18:51:25,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:51:25,148 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:25,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 310 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:51:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-22 18:51:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-22 18:51:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 122 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2024-11-22 18:51:25,155 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 15 [2024-11-22 18:51:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2024-11-22 18:51:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2024-11-22 18:51:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:51:25,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:25,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:25,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-22 18:51:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:25,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 12604667, now seen corresponding path program 1 times [2024-11-22 18:51:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015793219] [2024-11-22 18:51:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:25,364 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:25,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-22 18:51:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:25,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 18:51:25,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:25,544 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-22 18:51:25,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-22 18:51:25,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:51:25,658 INFO L349 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2024-11-22 18:51:25,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2024-11-22 18:51:25,687 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 18 treesize of output 13 [2024-11-22 18:51:25,722 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 19 treesize of output 7 [2024-11-22 18:51:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:25,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:25,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015793219] [2024-11-22 18:51:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015793219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:25,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:51:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341449538] [2024-11-22 18:51:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:51:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:51:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:51:25,756 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:26,349 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2024-11-22 18:51:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:51:26,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 18:51:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:26,350 INFO L225 Difference]: With dead ends: 123 [2024-11-22 18:51:26,351 INFO L226 Difference]: Without dead ends: 123 [2024-11-22 18:51:26,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:51:26,354 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 120 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:26,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 283 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:51:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-22 18:51:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-22 18:51:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 122 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-11-22 18:51:26,357 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 15 [2024-11-22 18:51:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:26,357 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-11-22 18:51:26,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-11-22 18:51:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:51:26,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:26,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:26,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-22 18:51:26,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:26,563 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:26,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -329923626, now seen corresponding path program 1 times [2024-11-22 18:51:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940020335] [2024-11-22 18:51:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:26,566 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:26,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 18:51:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:26,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:51:26,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:26,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:26,772 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 15 treesize of output 7 [2024-11-22 18:51:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:26,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:26,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:26,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940020335] [2024-11-22 18:51:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940020335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:51:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384289207] [2024-11-22 18:51:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:26,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:51:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:51:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:51:26,803 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:27,508 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2024-11-22 18:51:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:51:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:27,510 INFO L225 Difference]: With dead ends: 181 [2024-11-22 18:51:27,511 INFO L226 Difference]: Without dead ends: 181 [2024-11-22 18:51:27,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-22 18:51:27,512 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 82 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:27,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 267 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:51:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-22 18:51:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 152. [2024-11-22 18:51:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 123 states have (on average 1.6991869918699187) internal successors, (209), 151 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2024-11-22 18:51:27,519 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 16 [2024-11-22 18:51:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:27,519 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2024-11-22 18:51:27,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2024-11-22 18:51:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:51:27,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:27,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:27,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 18:51:27,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:27,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:27,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash -329923625, now seen corresponding path program 1 times [2024-11-22 18:51:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98129869] [2024-11-22 18:51:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:27,726 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:27,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 18:51:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:27,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:51:27,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:27,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:51:28,098 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 15 treesize of output 7 [2024-11-22 18:51:28,101 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 7 treesize of output 3 [2024-11-22 18:51:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:28,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:28,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98129869] [2024-11-22 18:51:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98129869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:51:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842543703] [2024-11-22 18:51:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:28,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:51:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:51:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:51:28,153 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:28,822 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2024-11-22 18:51:28,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:51:28,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:28,823 INFO L225 Difference]: With dead ends: 145 [2024-11-22 18:51:28,823 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 18:51:28,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:51:28,825 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 39 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:28,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 311 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:51:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 18:51:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2024-11-22 18:51:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.625) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2024-11-22 18:51:28,834 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 16 [2024-11-22 18:51:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2024-11-22 18:51:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 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-11-22 18:51:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2024-11-22 18:51:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:51:28,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:28,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:28,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 18:51:29,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:29,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1869510074, now seen corresponding path program 1 times [2024-11-22 18:51:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46145137] [2024-11-22 18:51:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:29,040 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:29,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 18:51:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:29,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:51:29,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:29,292 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 15 treesize of output 7 [2024-11-22 18:51:29,296 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 7 treesize of output 3 [2024-11-22 18:51:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:29,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:29,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46145137] [2024-11-22 18:51:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46145137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:51:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32474672] [2024-11-22 18:51:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:51:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:29,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:51:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:51:29,370 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:29,865 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2024-11-22 18:51:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:51:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 18:51:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:29,866 INFO L225 Difference]: With dead ends: 129 [2024-11-22 18:51:29,866 INFO L226 Difference]: Without dead ends: 129 [2024-11-22 18:51:29,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:51:29,867 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:29,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:51:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-22 18:51:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-11-22 18:51:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.553191489361702) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2024-11-22 18:51:29,869 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 19 [2024-11-22 18:51:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:29,873 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2024-11-22 18:51:29,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2024-11-22 18:51:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:51:29,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:29,874 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-11-22 18:51:29,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-22 18:51:30,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:30,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2120238052, now seen corresponding path program 1 times [2024-11-22 18:51:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439015543] [2024-11-22 18:51:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:30,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:30,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:30,090 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-22 18:51:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:30,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:51:30,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:30,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:30,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439015543] [2024-11-22 18:51:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439015543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:51:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79595052] [2024-11-22 18:51:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:51:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:30,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:51:30,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:51:30,302 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-22 18:51:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:30,405 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2024-11-22 18:51:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:51:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-22 18:51:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:30,406 INFO L225 Difference]: With dead ends: 122 [2024-11-22 18:51:30,406 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 18:51:30,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:51:30,406 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:30,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 254 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:51:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 18:51:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 18:51:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2024-11-22 18:51:30,408 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 20 [2024-11-22 18:51:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:30,408 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2024-11-22 18:51:30,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-22 18:51:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2024-11-22 18:51:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:51:30,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:30,409 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, 1] [2024-11-22 18:51:30,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-22 18:51:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:30,610 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1427941252, now seen corresponding path program 1 times [2024-11-22 18:51:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754082562] [2024-11-22 18:51:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:30,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:30,611 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:30,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-22 18:51:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:30,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:51:30,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:30,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:30,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:30,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754082562] [2024-11-22 18:51:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754082562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:30,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:51:30,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645837624] [2024-11-22 18:51:30,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:30,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:51:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:51:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:51:30,830 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:31,150 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2024-11-22 18:51:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:51:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-11-22 18:51:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:31,152 INFO L225 Difference]: With dead ends: 121 [2024-11-22 18:51:31,152 INFO L226 Difference]: Without dead ends: 121 [2024-11-22 18:51:31,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:51:31,152 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:31,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 289 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:51:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-22 18:51:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-22 18:51:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 120 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2024-11-22 18:51:31,155 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 22 [2024-11-22 18:51:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:31,155 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2024-11-22 18:51:31,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2024-11-22 18:51:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:51:31,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:31,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:31,165 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-11-22 18:51:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:31,357 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2072385010, now seen corresponding path program 1 times [2024-11-22 18:51:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540662334] [2024-11-22 18:51:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:31,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:31,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:31,361 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:31,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-22 18:51:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:31,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 18:51:31,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:31,585 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~head#1.base_13| (_ BitVec 64))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_13|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_13| (_ bv0 1))))) is different from true [2024-11-22 18:51:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:31,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:31,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540662334] [2024-11-22 18:51:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540662334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:51:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493144345] [2024-11-22 18:51:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:51:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:51:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-22 18:51:31,599 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:31,934 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2024-11-22 18:51:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:51:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-22 18:51:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:31,935 INFO L225 Difference]: With dead ends: 128 [2024-11-22 18:51:31,935 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:51:31,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-22 18:51:31,936 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:31,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-11-22 18:51:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:51:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 18:51:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.5647058823529412) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-11-22 18:51:31,938 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 23 [2024-11-22 18:51:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:31,938 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-11-22 18:51:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-11-22 18:51:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:51:31,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:31,938 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, 1, 1, 1, 1, 1] [2024-11-22 18:51:31,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-22 18:51:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:32,143 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1615578083, now seen corresponding path program 1 times [2024-11-22 18:51:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108967372] [2024-11-22 18:51:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:32,146 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:32,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-22 18:51:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:32,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:51:32,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:32,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:51:32,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108967372] [2024-11-22 18:51:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108967372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:51:32,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:51:32,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:51:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558321307] [2024-11-22 18:51:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:51:32,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:51:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:51:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:51:32,427 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:32,793 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-11-22 18:51:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:51:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-22 18:51:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:32,794 INFO L225 Difference]: With dead ends: 110 [2024-11-22 18:51:32,794 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 18:51:32,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:51:32,795 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:32,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:51:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 18:51:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-22 18:51:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 108 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2024-11-22 18:51:32,797 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 26 [2024-11-22 18:51:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:32,797 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2024-11-22 18:51:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2024-11-22 18:51:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:51:32,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:32,804 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, 1, 1, 1, 1, 1] [2024-11-22 18:51:32,810 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-11-22 18:51:33,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:33,005 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1615579717, now seen corresponding path program 1 times [2024-11-22 18:51:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765209304] [2024-11-22 18:51:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:33,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-11-22 18:51:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:33,007 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:33,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 (27)] Waiting until timeout for monitored process [2024-11-22 18:51:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:33,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 18:51:33,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:33,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:33,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:51:33,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:51:33,300 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 18:51:33,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-22 18:51:33,334 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 18 treesize of output 13 [2024-11-22 18:51:33,343 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 18 treesize of output 13 [2024-11-22 18:51:33,413 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 19 treesize of output 7 [2024-11-22 18:51:33,425 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 19 treesize of output 7 [2024-11-22 18:51:33,538 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 15 treesize of output 1 [2024-11-22 18:51:33,635 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-11-22 18:51:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:33,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:51:33,842 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 36 treesize of output 32 [2024-11-22 18:51:38,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:51:38,844 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 22 treesize of output 23 [2024-11-22 18:51:38,848 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 36 treesize of output 24 [2024-11-22 18:51:38,850 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 7 treesize of output 3 [2024-11-22 18:51:38,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:51:38,861 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 22 treesize of output 23 [2024-11-22 18:51:38,864 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 36 treesize of output 24 [2024-11-22 18:51:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:43,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765209304] [2024-11-22 18:51:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765209304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:51:43,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:51:43,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2024-11-22 18:51:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861525682] [2024-11-22 18:51:43,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:51:43,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 18:51:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 18:51:43,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=504, Unknown=20, NotChecked=0, Total=600 [2024-11-22 18:51:43,173 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:45,369 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2024-11-22 18:51:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:51:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 18:51:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:45,370 INFO L225 Difference]: With dead ends: 127 [2024-11-22 18:51:45,370 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 18:51:45,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=159, Invalid=941, Unknown=22, NotChecked=0, Total=1122 [2024-11-22 18:51:45,371 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 46 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:45,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 672 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 18:51:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 18:51:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2024-11-22 18:51:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 119 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2024-11-22 18:51:45,374 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 26 [2024-11-22 18:51:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2024-11-22 18:51:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2024-11-22 18:51:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:51:45,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:45,375 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, 1, 1, 1, 1, 1] [2024-11-22 18:51:45,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-22 18:51:45,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:45,580 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:45,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1615579718, now seen corresponding path program 1 times [2024-11-22 18:51:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893906544] [2024-11-22 18:51:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:45,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:45,583 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:51:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-22 18:51:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:45,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-22 18:51:45,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:45,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:51:45,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:51:45,884 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:51:45,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:51:45,895 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-11-22 18:51:45,926 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 18 treesize of output 13 [2024-11-22 18:51:45,933 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 18 treesize of output 13 [2024-11-22 18:51:46,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:51:46,019 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2024-11-22 18:51:46,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:51:46,029 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2024-11-22 18:51:46,134 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-11-22 18:51:46,141 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 15 treesize of output 1 [2024-11-22 18:51:46,261 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-11-22 18:51:46,265 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-11-22 18:51:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:46,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:51:46,944 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 60 treesize of output 56 [2024-11-22 18:51:46,946 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 90 treesize of output 82 [2024-11-22 18:51:46,995 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 36 treesize of output 28 [2024-11-22 18:51:47,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv12 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|)) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (bvule (bvadd (_ bv4 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|) .cse0) (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (forall ((v_ArrVal_764 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_765 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_create_~head~0#1.offset|)))) is different from false [2024-11-22 18:51:51,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:51:51,358 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 22 treesize of output 23 [2024-11-22 18:51:51,361 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 36 treesize of output 24 [2024-11-22 18:51:51,364 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 7 treesize of output 3 [2024-11-22 18:51:51,371 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 18:51:51,371 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 22 treesize of output 1 [2024-11-22 18:51:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:51,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:51:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893906544] [2024-11-22 18:51:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893906544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:51:51,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:51:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-22 18:51:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039096903] [2024-11-22 18:51:51,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:51:51,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 18:51:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:51:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 18:51:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=4, NotChecked=42, Total=552 [2024-11-22 18:51:51,378 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:51:55,299 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2024-11-22 18:51:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:51:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 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 26 [2024-11-22 18:51:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:51:55,300 INFO L225 Difference]: With dead ends: 127 [2024-11-22 18:51:55,304 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 18:51:55,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=4, NotChecked=62, Total=1122 [2024-11-22 18:51:55,305 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 42 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:51:55,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 816 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 803 Invalid, 0 Unknown, 71 Unchecked, 3.0s Time] [2024-11-22 18:51:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 18:51:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2024-11-22 18:51:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 119 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2024-11-22 18:51:55,306 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 26 [2024-11-22 18:51:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:51:55,307 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2024-11-22 18:51:55,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:51:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2024-11-22 18:51:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:51:55,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:51:55,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:51:55,315 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-11-22 18:51:55,511 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-11-22 18:51:55,513 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-22 18:51:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:51:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1337507055, now seen corresponding path program 1 times [2024-11-22 18:51:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:51:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161319149] [2024-11-22 18:51:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:51:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:51:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:51:55,516 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-11-22 18:51:55,517 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-11-22 18:51:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:51:55,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-22 18:51:55,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:51:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 18:51:55,927 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-11-22 18:51:55,936 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-11-22 18:51:55,998 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 18:51:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-22 18:51:56,013 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-11-22 18:51:56,061 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-11-22 18:51:56,069 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-11-22 18:51:56,394 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 19 treesize of output 11 [2024-11-22 18:51:56,409 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 26 treesize of output 14 [2024-11-22 18:51:56,513 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-11-22 18:51:56,528 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-11-22 18:51:56,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:51:56,587 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-11-22 18:51:56,596 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-11-22 18:51:56,666 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 19 treesize of output 18 [2024-11-22 18:51:56,677 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 44 treesize of output 24 [2024-11-22 18:51:56,819 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-22 18:51:56,820 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-11-22 18:51:56,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 18:51:56,899 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-11-22 18:51:56,910 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 23 treesize of output 16 [2024-11-22 18:51:57,002 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-11-22 18:51:57,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 18:51:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:51:57,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:51:57,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_879 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_880 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_879 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv8 64) .cse1)))))) is different from false [2024-11-22 18:51:57,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_877 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_22| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_22|))) (forall ((v_ArrVal_879 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_880 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_878 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_22| v_ArrVal_879) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_22| v_ArrVal_878) (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_877)) |v_ULTIMATE.start_create_~ptr~0#1.base_22| v_ArrVal_880) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_22| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_22|))) (forall ((v_ArrVal_879 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_22| v_ArrVal_879) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv8 64) .cse2)))))))) is different from false