./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0137.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/test-0137.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:09:47,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:09:47,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:09:47,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:09:47,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:09:47,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:09:47,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:09:47,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:09:47,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:09:47,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:09:47,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:09:47,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:09:47,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:09:47,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:09:47,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:09:47,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:09:47,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:09:47,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:09:47,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:09:47,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:09:47,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:09:47,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:09:47,141 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:09:47,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:09:47,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:09:47,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:09:47,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:09:47,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:09:47,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:09:47,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:09:47,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:09:47,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:09:47,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:09:47,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:09:47,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:09:47,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:09:47,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:09:47,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:09:47,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:09:47,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:09:47,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:09:47,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:09:47,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a [2024-11-10 15:09:47,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:09:47,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:09:47,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:09:47,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:09:47,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:09:47,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i [2024-11-10 15:09:48,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:09:49,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:09:49,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i [2024-11-10 15:09:49,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3710fc3d/a559e3a3baaf490eb02c5b5079211851/FLAG75b256d34 [2024-11-10 15:09:49,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3710fc3d/a559e3a3baaf490eb02c5b5079211851 [2024-11-10 15:09:49,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:09:49,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:09:49,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:49,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:09:49,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:09:49,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:49" (1/1) ... [2024-11-10 15:09:49,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c72c137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:49, skipping insertion in model container [2024-11-10 15:09:49,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:49" (1/1) ... [2024-11-10 15:09:49,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:09:49,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:49,677 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-10 15:09:49,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f2ea6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:49, skipping insertion in model container [2024-11-10 15:09:49,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:49,678 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:09:49,686 INFO L158 Benchmark]: Toolchain (without parser) took 481.50ms. Allocated memory is still 151.0MB. Free memory was 79.7MB in the beginning and 122.6MB in the end (delta: -42.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 15:09:49,686 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:09:49,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.26ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 122.6MB in the end (delta: -43.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 15:09:49,689 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.49ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 78.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.26ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 122.6MB in the end (delta: -43.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 585]: 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/11.0.12-open/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/test-0137.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:09:51,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:09:51,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:09:51,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:09:51,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:09:51,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:09:51,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:09:51,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:09:51,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:09:51,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:09:51,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:09:51,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:09:51,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:09:51,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:09:51,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:09:51,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:09:51,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:09:51,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:09:51,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:09:51,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:09:51,794 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:09:51,795 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:09:51,795 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:09:51,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:09:51,795 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:09:51,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:09:51,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:09:51,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:09:51,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:09:51,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:09:51,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:09:51,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:09:51,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:09:51,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:09:51,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:09:51,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:09:51,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:09:51,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:09:51,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:09:51,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:09:51,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:09:51,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:09:51,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:09:51,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:09:51,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a [2024-11-10 15:09:52,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:09:52,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:09:52,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:09:52,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:09:52,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:09:52,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i [2024-11-10 15:09:53,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:09:53,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:09:53,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i [2024-11-10 15:09:53,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cb50d13/0dbd5b30f3ac4771bfd552643050a3dd/FLAG285a21c07 [2024-11-10 15:09:53,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44cb50d13/0dbd5b30f3ac4771bfd552643050a3dd [2024-11-10 15:09:53,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:09:53,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:09:53,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:53,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:09:53,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:09:53,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:53" (1/1) ... [2024-11-10 15:09:53,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abb98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:53, skipping insertion in model container [2024-11-10 15:09:53,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:09:53" (1/1) ... [2024-11-10 15:09:54,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:09:54,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:54,406 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:09:54,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:09:54,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:54,461 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:09:54,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:09:54,555 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:09:54,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54 WrapperNode [2024-11-10 15:09:54,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:09:54,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:09:54,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:09:54,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:09:54,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,619 INFO L138 Inliner]: procedures = 140, calls = 60, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 136 [2024-11-10 15:09:54,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:09:54,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:09:54,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:09:54,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:09:54,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,672 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 12 writes are split as follows [0, 12]. [2024-11-10 15:09:54,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:09:54,692 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:09:54,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:09:54,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:09:54,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (1/1) ... [2024-11-10 15:09:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:09:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:09:54,731 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-10 15:09:54,738 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-10 15:09:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2024-11-10 15:09:54,788 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2024-11-10 15:09:54,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 15:09:54,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 15:09:54,788 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2024-11-10 15:09:54,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2024-11-10 15:09:54,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-10 15:09:54,790 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 15:09:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:09:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:09:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 15:09:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 15:09:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-10 15:09:54,791 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-10 15:09:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:09:54,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:09:54,930 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:09:54,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:09:55,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc #t~mem14; [2024-11-10 15:09:55,065 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc #t~mem3.base, #t~mem3.offset; [2024-11-10 15:09:55,545 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-10 15:09:55,545 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:09:55,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:09:55,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:09:55,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:55 BoogieIcfgContainer [2024-11-10 15:09:55,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:09:55,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:09:55,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:09:55,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:09:55,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:09:53" (1/3) ... [2024-11-10 15:09:55,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c45ab6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:55, skipping insertion in model container [2024-11-10 15:09:55,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:09:54" (2/3) ... [2024-11-10 15:09:55,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c45ab6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:09:55, skipping insertion in model container [2024-11-10 15:09:55,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:09:55" (3/3) ... [2024-11-10 15:09:55,576 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0137.i [2024-11-10 15:09:55,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:09:55,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-11-10 15:09:55,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:09:55,648 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;@209dffb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:09:55,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-10 15:09:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 79 states have (on average 1.860759493670886) internal successors, (147), 135 states have internal predecessors, (147), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:09:55,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:55,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:09:55,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash 186056640, now seen corresponding path program 1 times [2024-11-10 15:09:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149409405] [2024-11-10 15:09:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:55,681 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-10 15:09:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:55,683 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-10 15:09:55,685 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-10 15:09:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:55,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 15:09:55,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:55,811 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-10 15:09:55,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:55,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:55,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149409405] [2024-11-10 15:09:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149409405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79879571] [2024-11-10 15:09:55,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:09:55,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:55,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:09:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:09:55,850 INFO L87 Difference]: Start difference. First operand has 147 states, 79 states have (on average 1.860759493670886) internal successors, (147), 135 states have internal predecessors, (147), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:55,875 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2024-11-10 15:09:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:09:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:09:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:55,887 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:09:55,887 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:09:55,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:09:55,893 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:55,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:09:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:09:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:09:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 132 states have internal predecessors, (139), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2024-11-10 15:09:55,940 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 5 [2024-11-10 15:09:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2024-11-10 15:09:55,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2024-11-10 15:09:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:09:55,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:55,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:09:55,945 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-10 15:09:56,144 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-10 15:09:56,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 186056671, now seen corresponding path program 1 times [2024-11-10 15:09:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477804320] [2024-11-10 15:09:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:56,146 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-10 15:09:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:56,149 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-10 15:09:56,150 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-10 15:09:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:56,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 15:09:56,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:56,279 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-10 15:09:56,300 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-10 15:09:56,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:56,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477804320] [2024-11-10 15:09:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477804320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296659932] [2024-11-10 15:09:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:56,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:09:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:09:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:09:56,307 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:56,500 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2024-11-10 15:09:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:09:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:09:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:56,501 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:09:56,501 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:09:56,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:09:56,506 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:56,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 236 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:09:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:09:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-10 15:09:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 131 states have internal predecessors, (138), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2024-11-10 15:09:56,518 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 5 [2024-11-10 15:09:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:56,519 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2024-11-10 15:09:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2024-11-10 15:09:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:09:56,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:56,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:09:56,523 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 (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:09:56,723 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-10 15:09:56,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 186056672, now seen corresponding path program 1 times [2024-11-10 15:09:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416579237] [2024-11-10 15:09:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:56,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-10 15:09:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:56,728 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-10 15:09:56,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 (4)] Waiting until timeout for monitored process [2024-11-10 15:09:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:56,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:09:56,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:56,792 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-10 15:09:56,814 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-10 15:09:56,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:56,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416579237] [2024-11-10 15:09:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416579237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:09:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525449974] [2024-11-10 15:09:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:56,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:09:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:09:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:09:56,817 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:57,025 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2024-11-10 15:09:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:09:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:09:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:57,027 INFO L225 Difference]: With dead ends: 142 [2024-11-10 15:09:57,027 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 15:09:57,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:09:57,028 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 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-10 15:09:57,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:09:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 15:09:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-10 15:09:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 130 states have internal predecessors, (137), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2024-11-10 15:09:57,037 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 5 [2024-11-10 15:09:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2024-11-10 15:09:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2024-11-10 15:09:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:09:57,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:57,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:57,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 15:09:57,239 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-10 15:09:57,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:57,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1988349901, now seen corresponding path program 1 times [2024-11-10 15:09:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492299692] [2024-11-10 15:09:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:57,241 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-10 15:09:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:57,242 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-10 15:09:57,244 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-10 15:09:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:57,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:09:57,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:57,368 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:09:57,368 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-10 15:09:57,426 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-10 15:09:57,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:57,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492299692] [2024-11-10 15:09:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492299692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:09:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765412732] [2024-11-10 15:09:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:09:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:57,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:09:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:09:57,429 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:57,874 INFO L93 Difference]: Finished difference Result 181 states and 189 transitions. [2024-11-10 15:09:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:09:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:09:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:57,876 INFO L225 Difference]: With dead ends: 181 [2024-11-10 15:09:57,876 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 15:09:57,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:09:57,877 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 174 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:57,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 228 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:09:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 15:09:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2024-11-10 15:09:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.7634408602150538) internal successors, (164), 143 states have internal predecessors, (164), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2024-11-10 15:09:57,890 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 8 [2024-11-10 15:09:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2024-11-10 15:09:57,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2024-11-10 15:09:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 15:09:57,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:57,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:57,896 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-10 15:09:58,091 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-10 15:09:58,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1988349900, now seen corresponding path program 1 times [2024-11-10 15:09:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642661087] [2024-11-10 15:09:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:58,093 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-10 15:09:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:58,095 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-10 15:09:58,096 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-10 15:09:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:58,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:09:58,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:58,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:09:58,301 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-10 15:09:58,392 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-10 15:09:58,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:58,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642661087] [2024-11-10 15:09:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642661087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:09:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808092006] [2024-11-10 15:09:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:09:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:09:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:09:58,394 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:58,865 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2024-11-10 15:09:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:09:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 15:09:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:58,867 INFO L225 Difference]: With dead ends: 158 [2024-11-10 15:09:58,867 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 15:09:58,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:09:58,868 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 311 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:58,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 159 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:09:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 15:09:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2024-11-10 15:09:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 133 states have internal predecessors, (148), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:09:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2024-11-10 15:09:58,881 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 8 [2024-11-10 15:09:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2024-11-10 15:09:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2024-11-10 15:09:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:09:58,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:58,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:58,886 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:09:59,082 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-10 15:09:59,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:09:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:09:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash 456192016, now seen corresponding path program 1 times [2024-11-10 15:09:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:09:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617450839] [2024-11-10 15:09:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:09:59,084 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-10 15:09:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:09:59,085 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-10 15:09:59,086 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-10 15:09:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:09:59,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:09:59,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:09:59,252 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-10 15:09:59,252 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 18 treesize of output 16 [2024-11-10 15:09:59,294 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-10 15:09:59,387 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-10 15:09:59,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:09:59,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:09:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617450839] [2024-11-10 15:09:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617450839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:09:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:09:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:09:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843198438] [2024-11-10 15:09:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:09:59,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:09:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:09:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:09:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:09:59,390 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:09:59,883 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2024-11-10 15:09:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:09:59,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:09:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:09:59,886 INFO L225 Difference]: With dead ends: 158 [2024-11-10 15:09:59,886 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 15:09:59,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:09:59,887 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 17 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:09:59,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 608 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:09:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 15:09:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-10 15:09:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 96 states have (on average 1.625) internal successors, (156), 140 states have internal predecessors, (156), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:09:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2024-11-10 15:09:59,894 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 10 [2024-11-10 15:09:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:09:59,895 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2024-11-10 15:09:59,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:09:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2024-11-10 15:09:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:09:59,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:09:59,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:09:59,905 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-10 15:10:00,096 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-10 15:10:00,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:00,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash 456192017, now seen corresponding path program 1 times [2024-11-10 15:10:00,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:00,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697316148] [2024-11-10 15:10:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:00,098 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-10 15:10:00,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:00,099 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-10 15:10:00,100 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-10 15:10:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:00,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:10:00,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:00,300 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:10:00,300 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-10 15:10:00,326 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:10:00,326 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-10 15:10:00,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 16 treesize of output 11 [2024-11-10 15:10:00,405 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-10 15:10:00,570 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-10 15:10:00,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:00,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:00,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697316148] [2024-11-10 15:10:00,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697316148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:00,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:00,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:10:00,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948673212] [2024-11-10 15:10:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:10:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:10:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:10:00,572 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:01,183 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2024-11-10 15:10:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:01,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:10:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:01,185 INFO L225 Difference]: With dead ends: 160 [2024-11-10 15:10:01,185 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 15:10:01,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:10:01,186 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 26 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:01,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 552 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 15:10:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2024-11-10 15:10:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 96 states have (on average 1.6145833333333333) internal successors, (155), 140 states have internal predecessors, (155), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2024-11-10 15:10:01,196 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 10 [2024-11-10 15:10:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:01,196 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2024-11-10 15:10:01,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2024-11-10 15:10:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:10:01,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:01,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:01,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 15:10:01,397 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-10 15:10:01,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:01,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:01,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1257050607, now seen corresponding path program 1 times [2024-11-10 15:10:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:01,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668628426] [2024-11-10 15:10:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:01,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:10:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:01,400 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-10 15:10:01,401 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-10 15:10:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:01,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:10:01,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:01,501 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-10 15:10:01,540 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-10 15:10:01,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:01,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:01,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668628426] [2024-11-10 15:10:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668628426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:01,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:01,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404275608] [2024-11-10 15:10:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:01,543 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:01,889 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2024-11-10 15:10:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:10:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:01,891 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:10:01,891 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:10:01,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:01,892 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 24 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:01,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 441 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:10:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-11-10 15:10:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.5833333333333333) internal successors, (152), 139 states have internal predecessors, (152), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2024-11-10 15:10:01,898 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 11 [2024-11-10 15:10:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:01,898 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2024-11-10 15:10:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2024-11-10 15:10:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:10:01,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:01,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:01,905 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-10 15:10:02,100 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-10 15:10:02,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:02,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1257050608, now seen corresponding path program 1 times [2024-11-10 15:10:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:02,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149859260] [2024-11-10 15:10:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:02,102 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-10 15:10:02,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:02,105 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-10 15:10:02,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 15:10:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:02,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:10:02,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:02,190 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-10 15:10:02,268 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-10 15:10:02,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:02,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:02,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149859260] [2024-11-10 15:10:02,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149859260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:02,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:02,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822754682] [2024-11-10 15:10:02,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:10:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:10:02,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:10:02,271 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:02,632 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2024-11-10 15:10:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:10:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:10:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:02,634 INFO L225 Difference]: With dead ends: 157 [2024-11-10 15:10:02,634 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 15:10:02,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:02,634 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 19 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:02,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 474 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 15:10:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2024-11-10 15:10:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.5625) internal successors, (150), 139 states have internal predecessors, (150), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2024-11-10 15:10:02,640 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 11 [2024-11-10 15:10:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2024-11-10 15:10:02,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2024-11-10 15:10:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:10:02,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:02,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:02,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:02,844 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-10 15:10:02,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1139823020, now seen corresponding path program 1 times [2024-11-10 15:10:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282118514] [2024-11-10 15:10:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:02,846 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-10 15:10:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:02,848 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-10 15:10:02,849 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-10 15:10:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:02,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:10:02,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:02,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-10 15:10:02,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:02,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282118514] [2024-11-10 15:10:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282118514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:10:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997833994] [2024-11-10 15:10:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:02,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:10:02,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:02,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:10:02,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:10:02,965 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:03,126 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2024-11-10 15:10:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:10:03,127 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:10:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:03,127 INFO L225 Difference]: With dead ends: 152 [2024-11-10 15:10:03,127 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 15:10:03,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-10 15:10:03,129 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:03,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 294 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:10:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 15:10:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-10 15:10:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 138 states have internal predecessors, (148), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2024-11-10 15:10:03,133 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 13 [2024-11-10 15:10:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2024-11-10 15:10:03,133 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2024-11-10 15:10:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:10:03,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:03,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:03,138 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-10 15:10:03,334 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-10 15:10:03,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:03,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1139823021, now seen corresponding path program 1 times [2024-11-10 15:10:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53395056] [2024-11-10 15:10:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:03,335 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-10 15:10:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:03,337 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-10 15:10:03,338 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-10 15:10:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:03,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:10:03,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:03,495 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-10 15:10:03,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:03,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53395056] [2024-11-10 15:10:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53395056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:10:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022362983] [2024-11-10 15:10:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:10:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:03,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:10:03,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:03,497 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:03,811 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2024-11-10 15:10:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:10:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 15:10:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:03,812 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:10:03,812 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:10:03,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:10:03,813 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 158 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:03,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 519 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:10:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:10:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2024-11-10 15:10:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 96 states have (on average 1.53125) internal successors, (147), 138 states have internal predecessors, (147), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2024-11-10 15:10:03,818 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 13 [2024-11-10 15:10:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2024-11-10 15:10:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:10:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2024-11-10 15:10:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:10:03,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:03,820 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] [2024-11-10 15:10:03,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 15:10:04,020 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-10 15:10:04,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -804357108, now seen corresponding path program 1 times [2024-11-10 15:10:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364764288] [2024-11-10 15:10:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,021 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-10 15:10:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:04,023 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-10 15:10:04,023 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-10 15:10:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:10:04,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:04,209 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-10 15:10:04,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:04,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364764288] [2024-11-10 15:10:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364764288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:04,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20688073] [2024-11-10 15:10:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:04,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:10:04,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:10:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:10:04,211 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:04,672 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2024-11-10 15:10:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-10 15:10:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:04,673 INFO L225 Difference]: With dead ends: 151 [2024-11-10 15:10:04,673 INFO L226 Difference]: Without dead ends: 151 [2024-11-10 15:10:04,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:04,674 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 143 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:04,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 335 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-10 15:10:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-10 15:10:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 137 states have internal predecessors, (146), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2024-11-10 15:10:04,678 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 22 [2024-11-10 15:10:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:04,680 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2024-11-10 15:10:04,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2024-11-10 15:10:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:10:04,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:04,681 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] [2024-11-10 15:10:04,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 15:10:04,881 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-10 15:10:04,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:04,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -804357107, now seen corresponding path program 1 times [2024-11-10 15:10:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889929511] [2024-11-10 15:10:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:04,882 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-10 15:10:04,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:04,884 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-10 15:10:04,884 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-10 15:10:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:04,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:10:04,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:05,167 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-10 15:10:05,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:05,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889929511] [2024-11-10 15:10:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889929511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:10:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136534112] [2024-11-10 15:10:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:10:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:10:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:10:05,169 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:05,670 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2024-11-10 15:10:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:10:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-10 15:10:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:05,672 INFO L225 Difference]: With dead ends: 150 [2024-11-10 15:10:05,672 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 15:10:05,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:10:05,673 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 144 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:05,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:10:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 15:10:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-10 15:10:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 136 states have internal predecessors, (145), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2024-11-10 15:10:05,678 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 22 [2024-11-10 15:10:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:05,678 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2024-11-10 15:10:05,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:10:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2024-11-10 15:10:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:10:05,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:05,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:05,685 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-10 15:10:05,879 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-10 15:10:05,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1117031910, now seen corresponding path program 1 times [2024-11-10 15:10:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:05,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872845154] [2024-11-10 15:10:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:05,881 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-10 15:10:05,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:05,884 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-10 15:10:05,886 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-10 15:10:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:06,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 15:10:06,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:06,070 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-10 15:10:06,221 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-10 15:10:06,360 INFO L349 Elim1Store]: treesize reduction 116, result has 26.6 percent of original size [2024-11-10 15:10:06,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 67 [2024-11-10 15:10:06,506 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 28 treesize of output 21 [2024-11-10 15:10:06,781 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 27 treesize of output 15 [2024-11-10 15:10:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:06,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:07,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_345) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)))) is different from false [2024-11-10 15:10:07,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:07,352 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 25 treesize of output 26 [2024-11-10 15:10:07,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:07,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-10 15:10:07,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872845154] [2024-11-10 15:10:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872845154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2065117796] [2024-11-10 15:10:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:10:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:10:07,412 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:10:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-10 15:10:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:07,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 15:10:07,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:07,829 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:10:07,830 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-10 15:10:08,193 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-10 15:10:08,393 INFO L349 Elim1Store]: treesize reduction 112, result has 27.3 percent of original size [2024-11-10 15:10:08,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 60 [2024-11-10 15:10:08,503 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 28 treesize of output 21 [2024-11-10 15:10:08,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 19 treesize of output 11 [2024-11-10 15:10:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:08,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:08,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_410) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2024-11-10 15:10:08,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~0#1.base_15| (_ BitVec 32)) (v_ArrVal_409 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_15|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_15| v_ArrVal_409) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_15| v_ArrVal_410) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2024-11-10 15:10:08,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:08,835 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 25 treesize of output 26 [2024-11-10 15:10:08,838 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:08,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-10 15:10:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2065117796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:12,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2024-11-10 15:10:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505324780] [2024-11-10 15:10:12,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:12,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:10:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:12,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:10:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1036, Unknown=16, NotChecked=204, Total=1406 [2024-11-10 15:10:12,881 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:15,287 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2024-11-10 15:10:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:10:15,287 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-10 15:10:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:15,288 INFO L225 Difference]: With dead ends: 237 [2024-11-10 15:10:15,288 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 15:10:15,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=295, Invalid=1593, Unknown=16, NotChecked=258, Total=2162 [2024-11-10 15:10:15,289 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 543 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:15,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1086 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 15:10:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 15:10:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 157. [2024-11-10 15:10:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 142 states have internal predecessors, (149), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:10:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2024-11-10 15:10:15,295 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 26 [2024-11-10 15:10:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2024-11-10 15:10:15,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2024-11-10 15:10:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:10:15,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:15,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:15,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-10 15:10:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:15,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10 15:10:15,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:15,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1117031911, now seen corresponding path program 1 times [2024-11-10 15:10:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728539189] [2024-11-10 15:10:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:15,698 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-10 15:10:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:15,700 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-10 15:10:15,701 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-10 15:10:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:15,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:10:15,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:15,907 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-10 15:10:15,912 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-10 15:10:16,128 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-10 15:10:16,133 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-10 15:10:16,307 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-10 15:10:16,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2024-11-10 15:10:16,320 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:10:16,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 15:10:16,395 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 26 treesize of output 19 [2024-11-10 15:10:16,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-10 15:10:16,494 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 17 treesize of output 9 [2024-11-10 15:10:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:16,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:16,791 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_478) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2024-11-10 15:10:16,851 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_19| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19|) (_ bv0 1))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_19| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19|) (_ bv0 1))) (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_477 (_ BitVec 32)) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19| v_ArrVal_477) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_19| v_ArrVal_478) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))) is different from false [2024-11-10 15:10:17,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:17,066 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 41 treesize of output 32 [2024-11-10 15:10:17,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:17,071 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 26 treesize of output 14 [2024-11-10 15:10:17,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:17,082 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 42 treesize of output 43 [2024-11-10 15:10:17,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:17,089 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 40 treesize of output 32 [2024-11-10 15:10:17,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:17,100 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 27 treesize of output 28 [2024-11-10 15:10:17,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:17,108 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 17 [2024-11-10 15:10:17,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728539189] [2024-11-10 15:10:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728539189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [218374220] [2024-11-10 15:10:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:10:17,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:10:17,267 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:10:17,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-10 15:10:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:17,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:10:17,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:17,679 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-10 15:10:17,684 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-10 15:10:18,254 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-10 15:10:18,265 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-10 15:10:18,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:18,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:18,541 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:10:18,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 15:10:18,566 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-10 15:10:18,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2024-11-10 15:10:18,727 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 26 treesize of output 19 [2024-11-10 15:10:18,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-10 15:10:18,952 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 17 treesize of output 9 [2024-11-10 15:10:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:18,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:19,314 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_549 (_ BitVec 32)) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_550) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_549) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23|))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_550) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23|)))))) is different from false [2024-11-10 15:10:19,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:19,532 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 42 treesize of output 43 [2024-11-10 15:10:19,535 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:19,536 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 40 treesize of output 32 [2024-11-10 15:10:19,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:19,546 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 27 treesize of output 28 [2024-11-10 15:10:19,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:19,550 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 17 [2024-11-10 15:10:19,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:10:19,568 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 41 treesize of output 32 [2024-11-10 15:10:19,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:10:19,571 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 26 treesize of output 14 [2024-11-10 15:10:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [218374220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:19,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 15:10:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001863463] [2024-11-10 15:10:19,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:10:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:10:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1038, Unknown=25, NotChecked=204, Total=1406 [2024-11-10 15:10:19,680 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:22,469 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2024-11-10 15:10:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:10:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-10 15:10:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:22,471 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:10:22,471 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:10:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=261, Invalid=1445, Unknown=28, NotChecked=246, Total=1980 [2024-11-10 15:10:22,472 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 590 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:22,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 744 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 15:10:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:10:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 149. [2024-11-10 15:10:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.5) internal successors, (141), 135 states have internal predecessors, (141), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2024-11-10 15:10:22,478 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 26 [2024-11-10 15:10:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:22,478 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2024-11-10 15:10:22,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 23 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2024-11-10 15:10:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:10:22,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:22,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:22,487 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-10 15:10:22,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:22,880 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:10:22,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:22,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 905207948, now seen corresponding path program 1 times [2024-11-10 15:10:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268511170] [2024-11-10 15:10:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:22,881 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-10 15:10:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:22,882 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-10 15:10:22,884 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-10 15:10:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:22,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:10:23,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:23,094 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-10 15:10:23,297 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-10 15:10:23,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:23,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268511170] [2024-11-10 15:10:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268511170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:23,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:23,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:23,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523570604] [2024-11-10 15:10:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:23,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:23,299 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:23,854 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2024-11-10 15:10:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:10:23,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-10 15:10:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:23,857 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:10:23,857 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 15:10:23,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:10:23,857 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 221 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:23,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 802 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 15:10:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2024-11-10 15:10:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 132 states have internal predecessors, (137), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2024-11-10 15:10:23,864 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 32 [2024-11-10 15:10:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2024-11-10 15:10:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:10:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2024-11-10 15:10:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:10:23,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:23,866 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-10 15:10:23,871 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-10 15:10:24,066 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-10 15:10:24,067 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:24,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1804025527, now seen corresponding path program 1 times [2024-11-10 15:10:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:24,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969076321] [2024-11-10 15:10:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:24,068 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-10 15:10:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:24,071 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-10 15:10:24,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-10 15:10:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:24,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:10:24,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:24,302 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-10 15:10:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:10:24,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:24,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969076321] [2024-11-10 15:10:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969076321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:24,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:24,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179665741] [2024-11-10 15:10:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:24,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:24,495 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:10:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:24,992 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-10 15:10:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:10:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-10 15:10:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:24,994 INFO L225 Difference]: With dead ends: 195 [2024-11-10 15:10:24,994 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 15:10:24,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:10:24,995 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 211 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:24,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 793 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:10:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 15:10:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 147. [2024-11-10 15:10:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.5) internal successors, (138), 132 states have internal predecessors, (138), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:10:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2024-11-10 15:10:24,999 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 37 [2024-11-10 15:10:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:25,000 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2024-11-10 15:10:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:10:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2024-11-10 15:10:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:10:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:25,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:25,007 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 (20)] Forceful destruction successful, exit code 0 [2024-11-10 15:10:25,201 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-10 15:10:25,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1271025607, now seen corresponding path program 1 times [2024-11-10 15:10:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429359189] [2024-11-10 15:10:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:25,203 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-10 15:10:25,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:25,204 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-10 15:10:25,204 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-10 15:10:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:25,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:10:25,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:25,374 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-10 15:10:25,477 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-10 15:10:25,579 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-10 15:10:25,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-10 15:10:25,614 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 11 [2024-11-10 15:10:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:10:25,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:10:25,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429359189] [2024-11-10 15:10:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429359189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:10:25,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:10:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:10:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629580974] [2024-11-10 15:10:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:10:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:10:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:25,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:10:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:10:25,682 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:10:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:26,923 INFO L93 Difference]: Finished difference Result 234 states and 251 transitions. [2024-11-10 15:10:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:10:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-10 15:10:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:26,924 INFO L225 Difference]: With dead ends: 234 [2024-11-10 15:10:26,924 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 15:10:26,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:10:26,925 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 304 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:26,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 550 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 15:10:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 15:10:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 171. [2024-11-10 15:10:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 152 states have internal predecessors, (166), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2024-11-10 15:10:26,930 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 39 [2024-11-10 15:10:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:26,930 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2024-11-10 15:10:26,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:10:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2024-11-10 15:10:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:10:26,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:26,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:26,938 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-10 15:10:27,134 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-10 15:10:27,135 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:27,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1271025606, now seen corresponding path program 1 times [2024-11-10 15:10:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45140641] [2024-11-10 15:10:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:27,136 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-10 15:10:27,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:27,137 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-10 15:10:27,138 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-10 15:10:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:27,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:10:27,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:27,325 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-10 15:10:27,330 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-10 15:10:27,495 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-10 15:10:27,500 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-10 15:10:27,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:27,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:27,787 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:10:27,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 15:10:27,812 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-10 15:10:27,813 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 24 treesize of output 26 [2024-11-10 15:10:27,917 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 17 treesize of output 9 [2024-11-10 15:10:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:28,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:32,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:10:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45140641] [2024-11-10 15:10:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45140641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754958658] [2024-11-10 15:10:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:32,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:10:32,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:10:32,590 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:10:32,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-10 15:10:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:32,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 15:10:33,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:33,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:10:33,403 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-10 15:10:33,408 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-10 15:10:33,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:10:33,783 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:10:33,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 15:10:34,150 INFO L349 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2024-11-10 15:10:34,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2024-11-10 15:10:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:10:34,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754958658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:10:34,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:10:34,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-10 15:10:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689470028] [2024-11-10 15:10:34,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:10:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:10:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:10:34,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:10:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=892, Unknown=1, NotChecked=0, Total=992 [2024-11-10 15:10:34,826 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:10:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:10:40,423 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2024-11-10 15:10:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:10:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-10 15:10:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:10:40,425 INFO L225 Difference]: With dead ends: 214 [2024-11-10 15:10:40,425 INFO L226 Difference]: Without dead ends: 214 [2024-11-10 15:10:40,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=270, Invalid=1709, Unknown=1, NotChecked=0, Total=1980 [2024-11-10 15:10:40,426 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 578 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:10:40,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 677 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-10 15:10:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-10 15:10:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 176. [2024-11-10 15:10:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 156 states have internal predecessors, (168), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:10:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2024-11-10 15:10:40,431 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 39 [2024-11-10 15:10:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:10:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2024-11-10 15:10:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:10:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2024-11-10 15:10:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:10:40,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:10:40,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:10:40,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-10 15:10:40,642 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-10 15:10:40,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10 15:10:40,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-10 15:10:40,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:10:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1071607956, now seen corresponding path program 1 times [2024-11-10 15:10:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:10:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860702423] [2024-11-10 15:10:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:10:40,836 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-10 15:10:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:10:40,837 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-10 15:10:40,838 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-10 15:10:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:10:41,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:10:41,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:10:41,080 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:10:41,081 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-10 15:10:41,102 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-10 15:10:41,109 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-10 15:10:41,220 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 15 treesize of output 11 [2024-11-10 15:10:41,264 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 25 treesize of output 24 [2024-11-10 15:10:42,547 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-10 15:10:42,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 56 [2024-11-10 15:10:42,553 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 15 treesize of output 1 [2024-11-10 15:10:42,665 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-10 15:10:43,137 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 40 treesize of output 28 [2024-11-10 15:10:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:10:43,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:10:43,823 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-10 15:10:43,823 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 28 treesize of output 27 [2024-11-10 15:10:43,935 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-10 15:10:43,935 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 28 treesize of output 27 [2024-11-10 15:10:44,682 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 76 treesize of output 72 [2024-11-10 15:10:45,997 INFO L349 Elim1Store]: treesize reduction 132, result has 62.2 percent of original size [2024-11-10 15:10:45,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 50882 treesize of output 49022 [2024-11-10 15:11:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:11:14,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:11:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860702423] [2024-11-10 15:11:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860702423] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 15:11:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:11:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [21] total 42 [2024-11-10 15:11:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411067730] [2024-11-10 15:11:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 15:11:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:11:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 15:11:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1632, Unknown=38, NotChecked=0, Total=1806 [2024-11-10 15:11:14,976 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:11:15,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse0))) (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_835) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|)) (= .cse1 |c_~#gl_list~0.base|) (= .cse0 |c_~#gl_list~0.base|) (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_30| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_30|))) (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_30| v_ArrVal_835) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))) is different from false [2024-11-10 15:11:15,354 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_835) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|)) is different from false