./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:57:33,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:57:33,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 16:57:33,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:57:33,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:57:33,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:57:33,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:57:33,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:57:33,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:57:33,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:57:33,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:57:33,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:57:33,981 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:57:33,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:57:33,983 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:57:33,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:57:33,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:57:33,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:57:33,984 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:57:33,984 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:57:33,984 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:57:33,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:57:33,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:57:33,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:57:33,986 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:57:33,986 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:57:33,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:57:33,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:57:33,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:57:33,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:57:33,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:57:33,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:57:33,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:57:33,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:57:33,990 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 16:57:34,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:57:34,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:57:34,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:57:34,253 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:57:34,253 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:57:34,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-11-22 16:57:35,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:57:35,613 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:57:35,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-11-22 16:57:35,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badf614b9/fef765e0330f4ae2b3a30f4496d2f952/FLAG48965bc74 [2023-11-22 16:57:35,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badf614b9/fef765e0330f4ae2b3a30f4496d2f952 [2023-11-22 16:57:35,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:57:35,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:57:35,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:57:35,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:57:35,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:57:35,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:57:35" (1/1) ... [2023-11-22 16:57:35,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456c4194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:35, skipping insertion in model container [2023-11-22 16:57:35,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:57:35" (1/1) ... [2023-11-22 16:57:35,683 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:57:35,950 WARN L580 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-11-22 16:57:35,951 WARN L580 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-11-22 16:57:35,951 WARN L580 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-11-22 16:57:35,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:57:36,002 ERROR L324 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) [2023-11-22 16:57:36,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b5fe943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:36, skipping insertion in model container [2023-11-22 16:57:36,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:57:36,004 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-22 16:57:36,005 INFO L158 Benchmark]: Toolchain (without parser) took 366.73ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 151.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 16:57:36,006 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 81.6MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 16:57:36,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.04ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 151.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 16:57:36,008 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.14ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 81.6MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.04ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 151.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:57:37,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:57:37,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-22 16:57:37,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:57:37,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:57:37,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:57:37,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:57:37,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:57:37,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:57:37,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:57:37,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:57:37,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:57:37,851 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:57:37,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:57:37,853 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:57:37,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:57:37,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:57:37,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:57:37,853 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:57:37,854 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:57:37,854 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:57:37,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:57:37,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:57:37,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 16:57:37,855 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 16:57:37,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:57:37,856 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:57:37,856 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:57:37,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:57:37,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:57:37,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:57:37,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:57:37,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:57:37,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:57:37,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:57:37,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 16:57:37,859 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 16:57:37,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:57:37,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:57:37,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:57:37,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:57:37,860 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 16:57:37,860 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 16:57:38,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:57:38,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:57:38,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:57:38,127 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:57:38,127 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:57:38,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-11-22 16:57:39,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:57:39,442 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:57:39,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-1.i [2023-11-22 16:57:39,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e428c4a/4a97636b7dee49b9a76ad4f307ff631c/FLAGa3dffbf0f [2023-11-22 16:57:39,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e428c4a/4a97636b7dee49b9a76ad4f307ff631c [2023-11-22 16:57:39,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:57:39,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:57:39,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:57:39,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:57:39,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:57:39,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:57:39" (1/1) ... [2023-11-22 16:57:39,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53645a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:39, skipping insertion in model container [2023-11-22 16:57:39,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:57:39" (1/1) ... [2023-11-22 16:57:39,528 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:57:39,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:57:39,907 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-22 16:57:39,920 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:57:39,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:57:39,970 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 16:57:40,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:57:40,073 INFO L206 MainTranslator]: Completed translation [2023-11-22 16:57:40,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40 WrapperNode [2023-11-22 16:57:40,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:57:40,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 16:57:40,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 16:57:40,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 16:57:40,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,143 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 124 [2023-11-22 16:57:40,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 16:57:40,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 16:57:40,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 16:57:40,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 16:57:40,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,160 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,183 INFO L189 HeapSplitter]: Split 37 memory accesses to 2 slices as follows [2, 35] [2023-11-22 16:57:40,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 16:57:40,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 16:57:40,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 16:57:40,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 16:57:40,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (1/1) ... [2023-11-22 16:57:40,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:57:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:57:40,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 16:57:40,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 16:57:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 16:57:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 16:57:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 16:57:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-22 16:57:40,418 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 16:57:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 16:57:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 16:57:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 16:57:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-22 16:57:40,419 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-22 16:57:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-22 16:57:40,419 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-22 16:57:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-22 16:57:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 16:57:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 16:57:40,527 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 16:57:40,529 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 16:57:41,143 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 16:57:41,180 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 16:57:41,180 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-22 16:57:41,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:57:41 BoogieIcfgContainer [2023-11-22 16:57:41,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 16:57:41,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 16:57:41,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 16:57:41,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 16:57:41,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:57:39" (1/3) ... [2023-11-22 16:57:41,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259ed261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:57:41, skipping insertion in model container [2023-11-22 16:57:41,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:57:40" (2/3) ... [2023-11-22 16:57:41,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259ed261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:57:41, skipping insertion in model container [2023-11-22 16:57:41,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:57:41" (3/3) ... [2023-11-22 16:57:41,186 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-11-22 16:57:41,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 16:57:41,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2023-11-22 16:57:41,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 16:57:41,233 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7f0c2fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 16:57:41,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-11-22 16:57:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 102 states have (on average 2.343137254901961) internal successors, (239), 191 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-22 16:57:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:57:41,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:41,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:57:41,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:41,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 18699899, now seen corresponding path program 1 times [2023-11-22 16:57:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293465861] [2023-11-22 16:57:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:41,253 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 [2023-11-22 16:57:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:41,255 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) [2023-11-22 16:57:41,285 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 [2023-11-22 16:57:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:41,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 16:57:41,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:41,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:41,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293465861] [2023-11-22 16:57:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293465861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:57:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594701348] [2023-11-22 16:57:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:41,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 16:57:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:41,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 16:57:41,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 16:57:41,385 INFO L87 Difference]: Start difference. First operand has 201 states, 102 states have (on average 2.343137254901961) internal successors, (239), 191 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:41,442 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2023-11-22 16:57:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 16:57:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-22 16:57:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:41,450 INFO L225 Difference]: With dead ends: 197 [2023-11-22 16:57:41,450 INFO L226 Difference]: Without dead ends: 196 [2023-11-22 16:57:41,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 16:57:41,454 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:41,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:57:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-22 16:57:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-11-22 16:57:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 101 states have (on average 1.891089108910891) internal successors, (191), 185 states have internal predecessors, (191), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 16:57:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2023-11-22 16:57:41,485 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 4 [2023-11-22 16:57:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:41,485 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2023-11-22 16:57:41,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2023-11-22 16:57:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:57:41,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:41,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:57:41,504 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 [2023-11-22 16:57:41,689 WARN L477 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 [2023-11-22 16:57:41,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:41,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:41,690 INFO L85 PathProgramCache]: Analyzing trace with hash 18699961, now seen corresponding path program 1 times [2023-11-22 16:57:41,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:41,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274030333] [2023-11-22 16:57:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:41,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:57:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:41,692 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) [2023-11-22 16:57:41,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 (3)] Waiting until timeout for monitored process [2023-11-22 16:57:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:41,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 16:57:41,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:41,864 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 [2023-11-22 16:57:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:41,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:41,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:41,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274030333] [2023-11-22 16:57:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274030333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:41,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:57:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429288492] [2023-11-22 16:57:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:41,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:57:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:57:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:41,906 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:42,041 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2023-11-22 16:57:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:57:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-22 16:57:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:42,043 INFO L225 Difference]: With dead ends: 193 [2023-11-22 16:57:42,043 INFO L226 Difference]: Without dead ends: 193 [2023-11-22 16:57:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:42,044 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 7 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:42,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 331 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:57:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-22 16:57:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-11-22 16:57:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 101 states have (on average 1.8613861386138615) internal successors, (188), 182 states have internal predecessors, (188), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 16:57:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2023-11-22 16:57:42,053 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 4 [2023-11-22 16:57:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:42,053 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2023-11-22 16:57:42,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2023-11-22 16:57:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:57:42,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:42,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:57:42,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:42,265 WARN L477 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 [2023-11-22 16:57:42,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:42,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash 18699962, now seen corresponding path program 1 times [2023-11-22 16:57:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101118367] [2023-11-22 16:57:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:42,267 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 [2023-11-22 16:57:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:42,268 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) [2023-11-22 16:57:42,270 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 [2023-11-22 16:57:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:42,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 16:57:42,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:42,350 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 [2023-11-22 16:57:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:42,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:42,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101118367] [2023-11-22 16:57:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101118367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:42,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:42,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:57:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553800130] [2023-11-22 16:57:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:42,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:57:42,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:57:42,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:42,370 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:42,560 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2023-11-22 16:57:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:57:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-22 16:57:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:42,562 INFO L225 Difference]: With dead ends: 190 [2023-11-22 16:57:42,562 INFO L226 Difference]: Without dead ends: 190 [2023-11-22 16:57:42,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:42,563 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:42,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 334 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:57:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-22 16:57:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2023-11-22 16:57:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.8316831683168318) internal successors, (185), 179 states have internal predecessors, (185), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 16:57:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2023-11-22 16:57:42,571 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 4 [2023-11-22 16:57:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:42,571 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2023-11-22 16:57:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:57:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2023-11-22 16:57:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:57:42,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:42,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:42,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:42,774 WARN L477 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 [2023-11-22 16:57:42,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:42,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1254693481, now seen corresponding path program 1 times [2023-11-22 16:57:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348570984] [2023-11-22 16:57:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:42,776 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 [2023-11-22 16:57:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:42,777 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) [2023-11-22 16:57:42,784 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 [2023-11-22 16:57:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:42,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 16:57:42,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:42,915 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 16:57:42,916 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 [2023-11-22 16:57:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:42,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:42,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348570984] [2023-11-22 16:57:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348570984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 16:57:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393233523] [2023-11-22 16:57:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:42,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:57:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:57:42,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:57:42,983 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-22 16:57:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:43,389 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2023-11-22 16:57:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:57:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2023-11-22 16:57:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:43,400 INFO L225 Difference]: With dead ends: 222 [2023-11-22 16:57:43,400 INFO L226 Difference]: Without dead ends: 222 [2023-11-22 16:57:43,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:57:43,401 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 247 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:43,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 351 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 16:57:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-22 16:57:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 200. [2023-11-22 16:57:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 111 states have (on average 1.8738738738738738) internal successors, (208), 188 states have internal predecessors, (208), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 16:57:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2023-11-22 16:57:43,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 7 [2023-11-22 16:57:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:43,409 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2023-11-22 16:57:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-11-22 16:57:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2023-11-22 16:57:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-22 16:57:43,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:43,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:43,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-22 16:57:43,611 WARN L477 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 [2023-11-22 16:57:43,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:43,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1254693480, now seen corresponding path program 1 times [2023-11-22 16:57:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387459038] [2023-11-22 16:57:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:57:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:43,615 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) [2023-11-22 16:57:43,616 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 [2023-11-22 16:57:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:43,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 16:57:43,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:43,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:57:43,765 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 [2023-11-22 16:57:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:43,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:43,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387459038] [2023-11-22 16:57:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387459038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:57:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802205546] [2023-11-22 16:57:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:43,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:57:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:57:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:57:43,820 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-11-22 16:57:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:44,231 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2023-11-22 16:57:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:57:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2023-11-22 16:57:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:44,233 INFO L225 Difference]: With dead ends: 204 [2023-11-22 16:57:44,233 INFO L226 Difference]: Without dead ends: 204 [2023-11-22 16:57:44,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:44,233 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 434 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:44,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 264 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 16:57:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-22 16:57:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2023-11-22 16:57:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.8055555555555556) internal successors, (195), 181 states have internal predecessors, (195), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 16:57:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2023-11-22 16:57:44,238 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 7 [2023-11-22 16:57:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:44,239 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2023-11-22 16:57:44,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-11-22 16:57:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2023-11-22 16:57:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 16:57:44,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:44,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:44,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-22 16:57:44,442 WARN L477 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 [2023-11-22 16:57:44,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:44,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash -240785128, now seen corresponding path program 1 times [2023-11-22 16:57:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724588689] [2023-11-22 16:57:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:44,443 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 [2023-11-22 16:57:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:44,444 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) [2023-11-22 16:57:44,460 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 [2023-11-22 16:57:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:44,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 16:57:44,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:44,555 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-11-22 16:57:44,556 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 [2023-11-22 16:57:44,584 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 [2023-11-22 16:57:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:44,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:44,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724588689] [2023-11-22 16:57:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724588689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:57:44,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963095469] [2023-11-22 16:57:44,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:44,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:57:44,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:44,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:57:44,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:44,643 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2023-11-22 16:57:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:45,104 INFO L93 Difference]: Finished difference Result 210 states and 240 transitions. [2023-11-22 16:57:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:57:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 [2023-11-22 16:57:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:45,106 INFO L225 Difference]: With dead ends: 210 [2023-11-22 16:57:45,106 INFO L226 Difference]: Without dead ends: 210 [2023-11-22 16:57:45,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-22 16:57:45,107 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 19 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:45,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1085 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 16:57:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-22 16:57:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2023-11-22 16:57:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 187 states have internal predecessors, (202), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2023-11-22 16:57:45,112 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 8 [2023-11-22 16:57:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:45,112 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2023-11-22 16:57:45,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2023-11-22 16:57:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2023-11-22 16:57:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 16:57:45,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:45,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:45,316 WARN L477 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 [2023-11-22 16:57:45,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:45,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash -240785127, now seen corresponding path program 1 times [2023-11-22 16:57:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829208196] [2023-11-22 16:57:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:45,317 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 [2023-11-22 16:57:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:45,319 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) [2023-11-22 16:57:45,320 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 [2023-11-22 16:57:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:45,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 16:57:45,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:45,462 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:57:45,463 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 [2023-11-22 16:57:45,472 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 [2023-11-22 16:57:45,523 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 [2023-11-22 16:57:45,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 16:57:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:45,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:45,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829208196] [2023-11-22 16:57:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829208196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:57:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688709737] [2023-11-22 16:57:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:57:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:57:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:45,633 INFO L87 Difference]: Start difference. First operand 200 states and 231 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2023-11-22 16:57:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:46,235 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2023-11-22 16:57:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:57:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 [2023-11-22 16:57:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:46,237 INFO L225 Difference]: With dead ends: 209 [2023-11-22 16:57:46,237 INFO L226 Difference]: Without dead ends: 209 [2023-11-22 16:57:46,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-22 16:57:46,237 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 33 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:46,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 858 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 16:57:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-22 16:57:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 200. [2023-11-22 16:57:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 114 states have (on average 1.763157894736842) internal successors, (201), 187 states have internal predecessors, (201), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2023-11-22 16:57:46,241 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 8 [2023-11-22 16:57:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:46,241 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2023-11-22 16:57:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2023-11-22 16:57:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2023-11-22 16:57:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:57:46,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:46,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:46,249 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 [2023-11-22 16:57:46,449 WARN L477 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 [2023-11-22 16:57:46,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:46,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1125595957, now seen corresponding path program 1 times [2023-11-22 16:57:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385176931] [2023-11-22 16:57:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:46,450 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 [2023-11-22 16:57:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:46,452 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) [2023-11-22 16:57:46,452 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 [2023-11-22 16:57:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:46,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 16:57:46,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:46,520 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 [2023-11-22 16:57:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:46,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:46,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385176931] [2023-11-22 16:57:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385176931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:57:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136931912] [2023-11-22 16:57:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:57:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:57:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:57:46,550 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-22 16:57:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:46,937 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2023-11-22 16:57:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 16:57:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2023-11-22 16:57:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:46,938 INFO L225 Difference]: With dead ends: 205 [2023-11-22 16:57:46,938 INFO L226 Difference]: Without dead ends: 205 [2023-11-22 16:57:46,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:46,939 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 38 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:46,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 709 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 16:57:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-22 16:57:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2023-11-22 16:57:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.736842105263158) internal successors, (198), 186 states have internal predecessors, (198), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2023-11-22 16:57:46,942 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 9 [2023-11-22 16:57:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:46,942 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2023-11-22 16:57:46,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-22 16:57:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2023-11-22 16:57:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 16:57:46,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:46,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:46,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:47,146 WARN L477 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 [2023-11-22 16:57:47,146 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:47,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1125595958, now seen corresponding path program 1 times [2023-11-22 16:57:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651700219] [2023-11-22 16:57:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:47,147 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 [2023-11-22 16:57:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:47,152 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) [2023-11-22 16:57:47,200 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 [2023-11-22 16:57:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:47,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 16:57:47,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:47,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 16:57:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:47,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:47,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651700219] [2023-11-22 16:57:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651700219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:47,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:47,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 16:57:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214719401] [2023-11-22 16:57:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:47,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:57:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:57:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:57:47,292 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-22 16:57:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:47,629 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2023-11-22 16:57:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:57:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2023-11-22 16:57:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:47,630 INFO L225 Difference]: With dead ends: 203 [2023-11-22 16:57:47,630 INFO L226 Difference]: Without dead ends: 203 [2023-11-22 16:57:47,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:47,631 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 28 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:47,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 729 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 16:57:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-22 16:57:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2023-11-22 16:57:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.719298245614035) internal successors, (196), 186 states have internal predecessors, (196), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2023-11-22 16:57:47,635 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 9 [2023-11-22 16:57:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:47,635 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2023-11-22 16:57:47,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-22 16:57:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2023-11-22 16:57:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:57:47,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:47,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:47,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-22 16:57:47,839 WARN L477 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 [2023-11-22 16:57:47,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:47,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash -634033160, now seen corresponding path program 1 times [2023-11-22 16:57:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:47,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415622049] [2023-11-22 16:57:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:47,840 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 [2023-11-22 16:57:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:47,852 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) [2023-11-22 16:57:47,856 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 [2023-11-22 16:57:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:47,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 16:57:47,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:47,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:47,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415622049] [2023-11-22 16:57:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415622049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:47,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:47,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:57:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40217215] [2023-11-22 16:57:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:47,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:57:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:57:47,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:47,942 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) [2023-11-22 16:57:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:48,048 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2023-11-22 16:57:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:57:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 [2023-11-22 16:57:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:48,049 INFO L225 Difference]: With dead ends: 198 [2023-11-22 16:57:48,049 INFO L226 Difference]: Without dead ends: 198 [2023-11-22 16:57:48,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:57:48,049 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 6 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:48,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:57:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-22 16:57:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-11-22 16:57:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 185 states have internal predecessors, (194), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2023-11-22 16:57:48,053 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 11 [2023-11-22 16:57:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:48,054 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2023-11-22 16:57:48,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) [2023-11-22 16:57:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2023-11-22 16:57:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 16:57:48,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:48,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:48,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:48,257 WARN L477 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 [2023-11-22 16:57:48,258 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:48,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -634033159, now seen corresponding path program 1 times [2023-11-22 16:57:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192440510] [2023-11-22 16:57:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:48,259 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 [2023-11-22 16:57:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:48,262 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) [2023-11-22 16:57:48,264 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 [2023-11-22 16:57:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:48,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 16:57:48,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:48,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:48,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192440510] [2023-11-22 16:57:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192440510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:57:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48383271] [2023-11-22 16:57:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:57:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:57:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:57:48,428 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2023-11-22 16:57:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:48,678 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2023-11-22 16:57:48,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:57:48,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 [2023-11-22 16:57:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:48,679 INFO L225 Difference]: With dead ends: 200 [2023-11-22 16:57:48,679 INFO L226 Difference]: Without dead ends: 200 [2023-11-22 16:57:48,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 16:57:48,680 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 225 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:48,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 664 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 16:57:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-22 16:57:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2023-11-22 16:57:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 185 states have internal predecessors, (193), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2023-11-22 16:57:48,683 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 11 [2023-11-22 16:57:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:48,684 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2023-11-22 16:57:48,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2023-11-22 16:57:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2023-11-22 16:57:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 16:57:48,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:48,684 INFO L195 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] [2023-11-22 16:57:48,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:48,884 WARN L477 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 [2023-11-22 16:57:48,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting inspectErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:48,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1792420794, now seen corresponding path program 1 times [2023-11-22 16:57:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:48,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205751122] [2023-11-22 16:57:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:48,886 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 [2023-11-22 16:57:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:48,887 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) [2023-11-22 16:57:48,889 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 [2023-11-22 16:57:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:48,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 16:57:48,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:49,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:49,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205751122] [2023-11-22 16:57:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205751122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:57:49,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678546090] [2023-11-22 16:57:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 16:57:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 16:57:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:57:49,037 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2023-11-22 16:57:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:49,469 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2023-11-22 16:57:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:57:49,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2023-11-22 16:57:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:49,470 INFO L225 Difference]: With dead ends: 193 [2023-11-22 16:57:49,470 INFO L226 Difference]: Without dead ends: 193 [2023-11-22 16:57:49,470 INFO L412 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 [2023-11-22 16:57:49,471 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 362 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:49,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 362 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 16:57:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-22 16:57:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-11-22 16:57:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 114 states have (on average 1.6491228070175439) internal successors, (188), 180 states have internal predecessors, (188), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2023-11-22 16:57:49,474 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 23 [2023-11-22 16:57:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:49,475 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2023-11-22 16:57:49,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2023-11-22 16:57:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2023-11-22 16:57:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 16:57:49,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:49,476 INFO L195 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] [2023-11-22 16:57:49,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:49,678 WARN L477 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 [2023-11-22 16:57:49,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:49,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1792420795, now seen corresponding path program 1 times [2023-11-22 16:57:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:49,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965795048] [2023-11-22 16:57:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:49,680 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 [2023-11-22 16:57:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:49,681 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) [2023-11-22 16:57:49,682 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 [2023-11-22 16:57:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:49,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 16:57:49,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:49,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:57:49,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965795048] [2023-11-22 16:57:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965795048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:57:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:57:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 16:57:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546618636] [2023-11-22 16:57:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:57:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 16:57:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:57:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 16:57:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:57:49,955 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2023-11-22 16:57:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:57:50,546 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2023-11-22 16:57:50,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 16:57:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2023-11-22 16:57:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:57:50,547 INFO L225 Difference]: With dead ends: 192 [2023-11-22 16:57:50,547 INFO L226 Difference]: Without dead ends: 192 [2023-11-22 16:57:50,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-22 16:57:50,548 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 455 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 16:57:50,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 415 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 16:57:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-22 16:57:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-11-22 16:57:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 114 states have (on average 1.6403508771929824) internal successors, (187), 179 states have internal predecessors, (187), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 16:57:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2023-11-22 16:57:50,551 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 23 [2023-11-22 16:57:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:57:50,552 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2023-11-22 16:57:50,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2023-11-22 16:57:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2023-11-22 16:57:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 16:57:50,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:57:50,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:57:50,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-22 16:57:50,755 WARN L477 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 [2023-11-22 16:57:50,755 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:57:50,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:57:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1630883233, now seen corresponding path program 1 times [2023-11-22 16:57:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:57:50,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761907349] [2023-11-22 16:57:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:50,756 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 [2023-11-22 16:57:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:57:50,778 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) [2023-11-22 16:57:50,809 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 [2023-11-22 16:57:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:50,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 16:57:50,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:51,002 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 16:57:51,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 16:57:51,256 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 [2023-11-22 16:57:51,346 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 [2023-11-22 16:57:51,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:57:51,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 16:57:51,508 INFO L349 Elim1Store]: treesize reduction 92, result has 31.3 percent of original size [2023-11-22 16:57:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 67 [2023-11-22 16:57:51,615 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 36 treesize of output 27 [2023-11-22 16:57:51,846 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 35 treesize of output 19 [2023-11-22 16:57:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:51,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:57:56,149 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_19| (_ BitVec 32)) (v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_381) |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_383) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19|) (_ bv0 1))))) is different from false [2023-11-22 16:57:56,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:57:56,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-11-22 16:57:56,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:57:56,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-11-22 16:57:56,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-22 16:57:56,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:57:56,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761907349] [2023-11-22 16:57:56,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761907349] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:57:56,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1132048705] [2023-11-22 16:57:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:57:56,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 16:57:56,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 16:57:56,378 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) [2023-11-22 16:57:56,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-11-22 16:57:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:57:56,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-22 16:57:56,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:57:56,747 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-11-22 16:57:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-11-22 16:57:57,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 16:57:57,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 16:57:57,512 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:57:57,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-22 16:57:57,767 INFO L349 Elim1Store]: treesize reduction 122, result has 30.3 percent of original size [2023-11-22 16:57:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 76 [2023-11-22 16:57:57,984 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 44 treesize of output 33 [2023-11-22 16:57:58,232 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 35 treesize of output 19 [2023-11-22 16:57:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:57:58,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:57:58,347 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (_ BitVec 1)) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_23| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_461) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_383) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23|) (_ bv0 1))))) is different from false [2023-11-22 16:57:58,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (_ BitVec 1)) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_23| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_461) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_460) |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_383) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23|) (_ bv0 1))))) is different from false [2023-11-22 16:57:58,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:57:58,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-11-22 16:57:58,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:57:58,501 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 44 treesize of output 36 [2023-11-22 16:57:58,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-22 16:58:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1132048705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:58:00,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:58:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2023-11-22 16:58:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304417712] [2023-11-22 16:58:00,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:58:00,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 16:58:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:58:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 16:58:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1005, Unknown=15, NotChecked=204, Total=1406 [2023-11-22 16:58:00,727 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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) [2023-11-22 16:58:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:58:04,349 INFO L93 Difference]: Finished difference Result 347 states and 388 transitions. [2023-11-22 16:58:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 16:58:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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 24 [2023-11-22 16:58:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:58:04,351 INFO L225 Difference]: With dead ends: 347 [2023-11-22 16:58:04,351 INFO L226 Difference]: Without dead ends: 347 [2023-11-22 16:58:04,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=296, Invalid=1423, Unknown=15, NotChecked=246, Total=1980 [2023-11-22 16:58:04,352 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 1193 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:58:04,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1777 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-22 16:58:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-22 16:58:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 263. [2023-11-22 16:58:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 180 states have (on average 1.6611111111111112) internal successors, (299), 246 states have internal predecessors, (299), 25 states have call successors, (25), 8 states have call predecessors, (25), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 16:58:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 334 transitions. [2023-11-22 16:58:04,357 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 334 transitions. Word has length 24 [2023-11-22 16:58:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:58:04,357 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 334 transitions. [2023-11-22 16:58:04,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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) [2023-11-22 16:58:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 334 transitions. [2023-11-22 16:58:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 16:58:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:58:04,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 16:58:04,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-11-22 16:58:04,572 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 [2023-11-22 16:58:04,768 WARN L477 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 [2023-11-22 16:58:04,768 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:58:04,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:58:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1630883232, now seen corresponding path program 1 times [2023-11-22 16:58:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:58:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6936191] [2023-11-22 16:58:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:58:04,769 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 [2023-11-22 16:58:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:58:04,784 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) [2023-11-22 16:58:04,824 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 [2023-11-22 16:58:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:58:05,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-22 16:58:05,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:58:05,059 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:58:05,059 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 [2023-11-22 16:58:05,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 16:58:05,280 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 [2023-11-22 16:58:05,285 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 [2023-11-22 16:58:05,402 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 [2023-11-22 16:58:05,413 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 [2023-11-22 16:58:05,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:58:05,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-22 16:58:05,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 16:58:05,557 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-11-22 16:58:05,557 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 3 case distinctions, treesize of input 21 treesize of output 26 [2023-11-22 16:58:05,581 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:58:05,581 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 [2023-11-22 16:58:05,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-22 16:58:05,659 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 [2023-11-22 16:58:05,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 25 treesize of output 13 [2023-11-22 16:58:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:58:05,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:58:06,090 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_545) |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~1#1.base| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_545) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2023-11-22 16:58:09,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:09,110 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 119 treesize of output 143 [2023-11-22 16:58:09,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:09,148 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 106 treesize of output 107 [2023-11-22 16:58:09,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:09,186 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 96 treesize of output 97 [2023-11-22 16:58:09,216 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 186 treesize of output 178 [2023-11-22 16:58:09,262 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 826 treesize of output 790 [2023-11-22 16:58:09,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 135 [2023-11-22 16:58:09,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2023-11-22 16:58:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2023-11-22 16:58:09,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 127 [2023-11-22 16:58:09,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:09,378 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 127 treesize of output 118 [2023-11-22 16:58:09,411 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 168 treesize of output 156 [2023-11-22 16:58:09,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 141 [2023-11-22 16:58:09,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2023-11-22 16:58:11,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:58:11,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6936191] [2023-11-22 16:58:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6936191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:58:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [154162966] [2023-11-22 16:58:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:58:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 16:58:11,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 16:58:11,035 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) [2023-11-22 16:58:11,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-11-22 16:58:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:58:11,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-22 16:58:11,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:58:11,922 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 16:58:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 16:58:11,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 16:58:14,604 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 [2023-11-22 16:58:14,647 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 [2023-11-22 16:58:15,671 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 [2023-11-22 16:58:15,730 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 [2023-11-22 16:58:15,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:58:15,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-22 16:58:15,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 16:58:16,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:58:16,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:58:16,935 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-22 16:58:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2023-11-22 16:58:17,143 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2023-11-22 16:58:17,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2023-11-22 16:58:17,833 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 [2023-11-22 16:58:17,864 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 34 treesize of output 25 [2023-11-22 16:58:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 16:58:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:58:19,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 16:58:19,615 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_630) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_629) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_630) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2023-11-22 16:58:22,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:22,453 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 48 treesize of output 49 [2023-11-22 16:58:22,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:58:22,482 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 84 treesize of output 76 [2023-11-22 16:58:22,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:22,525 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 72 treesize of output 62 [2023-11-22 16:58:22,535 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:58:22,542 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 96 treesize of output 84 [2023-11-22 16:58:22,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-22 16:58:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-22 16:58:22,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 16:58:22,867 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 47 treesize of output 38 [2023-11-22 16:58:22,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 16:58:22,883 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 46 treesize of output 34 [2023-11-22 16:58:22,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 16:58:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [154162966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 16:58:23,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 16:58:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-11-22 16:58:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665596022] [2023-11-22 16:58:23,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 16:58:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 16:58:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:58:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 16:58:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1163, Unknown=13, NotChecked=142, Total=1482 [2023-11-22 16:58:23,571 INFO L87 Difference]: Start difference. First operand 263 states and 334 transitions. Second operand has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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) [2023-11-22 16:58:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:58:44,838 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2023-11-22 16:58:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 16:58:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 24 [2023-11-22 16:58:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:58:44,840 INFO L225 Difference]: With dead ends: 346 [2023-11-22 16:58:44,840 INFO L226 Difference]: Without dead ends: 346 [2023-11-22 16:58:44,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=355, Invalid=1802, Unknown=13, NotChecked=182, Total=2352 [2023-11-22 16:58:44,841 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 804 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-11-22 16:58:44,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1383 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2023-11-22 16:58:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-22 16:58:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 256. [2023-11-22 16:58:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 174 states have (on average 1.6781609195402298) internal successors, (292), 240 states have internal predecessors, (292), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 16:58:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 325 transitions. [2023-11-22 16:58:44,845 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 325 transitions. Word has length 24 [2023-11-22 16:58:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:58:44,846 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 325 transitions. [2023-11-22 16:58:44,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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) [2023-11-22 16:58:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 325 transitions. [2023-11-22 16:58:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 16:58:44,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:58:44,846 INFO L195 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] [2023-11-22 16:58:44,856 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 [2023-11-22 16:58:45,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-11-22 16:58:45,255 WARN L477 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 [2023-11-22 16:58:45,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:58:45,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:58:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 246383339, now seen corresponding path program 1 times [2023-11-22 16:58:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:58:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47553573] [2023-11-22 16:58:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:58:45,256 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 [2023-11-22 16:58:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:58:45,257 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) [2023-11-22 16:58:45,258 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 [2023-11-22 16:58:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:58:45,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 16:58:45,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:58:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:58:45,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:58:45,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:58:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47553573] [2023-11-22 16:58:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47553573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:58:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:58:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:58:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113919957] [2023-11-22 16:58:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:58:45,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 16:58:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:58:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 16:58:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:58:45,727 INFO L87 Difference]: Start difference. First operand 256 states and 325 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:58:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:58:46,566 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2023-11-22 16:58:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:58:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-22 16:58:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:58:46,567 INFO L225 Difference]: With dead ends: 255 [2023-11-22 16:58:46,567 INFO L226 Difference]: Without dead ends: 255 [2023-11-22 16:58:46,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 16:58:46,568 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 267 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 16:58:46,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 379 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 16:58:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-22 16:58:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2023-11-22 16:58:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 174 states have (on average 1.6666666666666667) internal successors, (290), 239 states have internal predecessors, (290), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 16:58:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2023-11-22 16:58:46,575 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 25 [2023-11-22 16:58:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:58:46,575 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2023-11-22 16:58:46,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:58:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2023-11-22 16:58:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 16:58:46,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:58:46,577 INFO L195 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] [2023-11-22 16:58:46,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-22 16:58:46,777 WARN L477 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 [2023-11-22 16:58:46,777 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting inspectErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:58:46,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:58:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1320502083, now seen corresponding path program 1 times [2023-11-22 16:58:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:58:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433476692] [2023-11-22 16:58:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:58:46,778 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 [2023-11-22 16:58:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:58:46,779 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) [2023-11-22 16:58:46,790 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 [2023-11-22 16:58:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:58:46,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 16:58:46,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:58:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:58:47,066 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 [2023-11-22 16:58:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:58:48,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:58:48,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:58:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433476692] [2023-11-22 16:58:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433476692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:58:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:58:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 16:58:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824789813] [2023-11-22 16:58:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:58:48,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 16:58:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:58:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 16:58:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 16:58:48,117 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 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) [2023-11-22 16:58:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:58:50,391 INFO L93 Difference]: Finished difference Result 253 states and 318 transitions. [2023-11-22 16:58:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 16:58:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 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 26 [2023-11-22 16:58:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:58:50,392 INFO L225 Difference]: With dead ends: 253 [2023-11-22 16:58:50,393 INFO L226 Difference]: Without dead ends: 253 [2023-11-22 16:58:50,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 16:58:50,393 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 272 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:58:50,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 178 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-22 16:58:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-22 16:58:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2023-11-22 16:58:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 237 states have internal predecessors, (286), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 16:58:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2023-11-22 16:58:50,399 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 26 [2023-11-22 16:58:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:58:50,400 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2023-11-22 16:58:50,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 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) [2023-11-22 16:58:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2023-11-22 16:58:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 16:58:50,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:58:50,400 INFO L195 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] [2023-11-22 16:58:50,410 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 [2023-11-22 16:58:50,601 WARN L477 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 [2023-11-22 16:58:50,601 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:58:50,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:58:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1975789109, now seen corresponding path program 1 times [2023-11-22 16:58:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:58:50,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919281474] [2023-11-22 16:58:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:58:50,602 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 [2023-11-22 16:58:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:58:50,603 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) [2023-11-22 16:58:50,604 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 [2023-11-22 16:58:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:58:50,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-22 16:58:50,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:58:50,892 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:58:50,892 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 [2023-11-22 16:58:51,527 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 [2023-11-22 16:58:51,800 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 [2023-11-22 16:58:51,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:58:51,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-22 16:58:52,489 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 16 treesize of output 8 [2023-11-22 16:58:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:58:52,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:58:52,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:58:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919281474] [2023-11-22 16:58:52,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919281474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:58:52,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:58:52,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-22 16:58:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906051943] [2023-11-22 16:58:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:58:52,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 16:58:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:58:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 16:58:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-22 16:58:52,629 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:59:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:59:00,565 INFO L93 Difference]: Finished difference Result 322 states and 360 transitions. [2023-11-22 16:59:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 16:59:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-11-22 16:59:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:59:00,567 INFO L225 Difference]: With dead ends: 322 [2023-11-22 16:59:00,567 INFO L226 Difference]: Without dead ends: 322 [2023-11-22 16:59:00,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2023-11-22 16:59:00,567 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 707 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-22 16:59:00,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 875 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-11-22 16:59:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-22 16:59:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 253. [2023-11-22 16:59:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 237 states have internal predecessors, (285), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 16:59:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 317 transitions. [2023-11-22 16:59:00,572 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 317 transitions. Word has length 28 [2023-11-22 16:59:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:59:00,572 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 317 transitions. [2023-11-22 16:59:00,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:59:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 317 transitions. [2023-11-22 16:59:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 16:59:00,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:59:00,572 INFO L195 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] [2023-11-22 16:59:00,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-22 16:59:00,776 WARN L477 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 [2023-11-22 16:59:00,776 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:59:00,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:59:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1620033190, now seen corresponding path program 1 times [2023-11-22 16:59:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:59:00,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215588162] [2023-11-22 16:59:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:59:00,777 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 [2023-11-22 16:59:00,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:59:00,793 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) [2023-11-22 16:59:00,827 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 [2023-11-22 16:59:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:59:00,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-22 16:59:00,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:59:01,237 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 16:59:01,238 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 [2023-11-22 16:59:01,497 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 [2023-11-22 16:59:01,552 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 [2023-11-22 16:59:03,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-22 16:59:03,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:59:03,625 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 32 treesize of output 15 [2023-11-22 16:59:03,638 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 17 treesize of output 18 [2023-11-22 16:59:03,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-22 16:59:03,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-22 16:59:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:59:05,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:59:05,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:59:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215588162] [2023-11-22 16:59:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215588162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:59:05,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:59:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-22 16:59:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356747263] [2023-11-22 16:59:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:59:05,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 16:59:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:59:05,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 16:59:05,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=203, Unknown=3, NotChecked=0, Total=240 [2023-11-22 16:59:05,475 INFO L87 Difference]: Start difference. First operand 253 states and 317 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:59:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:59:19,777 INFO L93 Difference]: Finished difference Result 407 states and 489 transitions. [2023-11-22 16:59:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 16:59:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-22 16:59:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:59:19,779 INFO L225 Difference]: With dead ends: 407 [2023-11-22 16:59:19,779 INFO L226 Difference]: Without dead ends: 407 [2023-11-22 16:59:19,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=84, Invalid=463, Unknown=5, NotChecked=0, Total=552 [2023-11-22 16:59:19,780 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 328 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-22 16:59:19,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 840 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1761 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2023-11-22 16:59:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-22 16:59:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 343. [2023-11-22 16:59:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 256 states have (on average 1.6015625) internal successors, (410), 320 states have internal predecessors, (410), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-22 16:59:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 452 transitions. [2023-11-22 16:59:19,785 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 452 transitions. Word has length 31 [2023-11-22 16:59:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:59:19,785 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 452 transitions. [2023-11-22 16:59:19,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 16:59:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 452 transitions. [2023-11-22 16:59:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 16:59:19,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:59:19,786 INFO L195 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] [2023-11-22 16:59:19,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-22 16:59:19,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 16:59:19,990 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting inspectErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 16:59:19,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:59:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash 997564862, now seen corresponding path program 1 times [2023-11-22 16:59:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 16:59:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175304997] [2023-11-22 16:59:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:59:19,991 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 [2023-11-22 16:59:19,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 16:59:19,992 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 16:59:19,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-22 16:59:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:59:20,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-22 16:59:20,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 16:59:20,509 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-22 16:59:20,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-22 16:59:20,766 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 [2023-11-22 16:59:20,819 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 [2023-11-22 16:59:23,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-22 16:59:23,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2023-11-22 16:59:23,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 16:59:23,302 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 42 treesize of output 23 [2023-11-22 16:59:23,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-22 16:59:23,710 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 [2023-11-22 16:59:23,896 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 16:59:23,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-22 16:59:26,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-22 16:59:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:59:26,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 16:59:26,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 16:59:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175304997] [2023-11-22 16:59:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175304997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:59:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:59:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-22 16:59:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877328983] [2023-11-22 16:59:26,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:59:26,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 16:59:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 16:59:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 16:59:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=197, Unknown=5, NotChecked=0, Total=240 [2023-11-22 16:59:26,421 INFO L87 Difference]: Start difference. First operand 343 states and 452 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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) [2023-11-22 16:59:32,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:35,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:39,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:41,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:44,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:46,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:48,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:51,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:53,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:56,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 16:59:58,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:01,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:07,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:09,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:11,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:13,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:17,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:00:21,618 INFO L93 Difference]: Finished difference Result 412 states and 494 transitions. [2023-11-22 17:00:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 17:00:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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 32 [2023-11-22 17:00:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:00:21,620 INFO L225 Difference]: With dead ends: 412 [2023-11-22 17:00:21,621 INFO L226 Difference]: Without dead ends: 412 [2023-11-22 17:00:21,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=82, Invalid=412, Unknown=12, NotChecked=0, Total=506 [2023-11-22 17:00:21,621 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 390 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 34 mSolverCounterUnsat, 133 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 133 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:00:21,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 727 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1934 Invalid, 133 Unknown, 0 Unchecked, 53.2s Time] [2023-11-22 17:00:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-22 17:00:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 343. [2023-11-22 17:00:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 256 states have (on average 1.59765625) internal successors, (409), 320 states have internal predecessors, (409), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-22 17:00:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 451 transitions. [2023-11-22 17:00:21,626 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 451 transitions. Word has length 32 [2023-11-22 17:00:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:00:21,627 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 451 transitions. [2023-11-22 17:00:21,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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) [2023-11-22 17:00:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 451 transitions. [2023-11-22 17:00:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 17:00:21,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:00:21,630 INFO L195 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] [2023-11-22 17:00:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-22 17:00:21,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:00:21,834 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting inspectErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 17:00:21,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:00:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 997564863, now seen corresponding path program 1 times [2023-11-22 17:00:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:00:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309240651] [2023-11-22 17:00:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:00:21,835 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 [2023-11-22 17:00:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:00:21,840 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) [2023-11-22 17:00:21,841 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 [2023-11-22 17:00:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:00:22,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-22 17:00:22,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:00:22,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:00:22,311 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 [2023-11-22 17:00:22,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 17:00:22,618 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 [2023-11-22 17:00:22,647 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 [2023-11-22 17:00:26,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-22 17:00:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:00:26,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2023-11-22 17:00:26,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 11 [2023-11-22 17:00:26,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-22 17:00:26,432 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-11-22 17:00:26,890 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 [2023-11-22 17:00:26,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:00:27,008 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 17 treesize of output 12 [2023-11-22 17:00:27,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 17:00:27,774 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 17:00:27,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-22 17:00:27,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-22 17:00:30,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-22 17:00:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:00:30,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:00:30,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:00:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309240651] [2023-11-22 17:00:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309240651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:00:30,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:00:30,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-22 17:00:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896669210] [2023-11-22 17:00:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:00:30,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:00:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:00:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:00:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=231, Unknown=2, NotChecked=0, Total=272 [2023-11-22 17:00:30,938 INFO L87 Difference]: Start difference. First operand 343 states and 451 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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) [2023-11-22 17:00:35,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:46,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:48,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:55,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:57,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:00:59,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:01:03,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 17:01:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:08,420 INFO L93 Difference]: Finished difference Result 402 states and 483 transitions. [2023-11-22 17:01:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 17:01:08,421 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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 32 [2023-11-22 17:01:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:08,423 INFO L225 Difference]: With dead ends: 402 [2023-11-22 17:01:08,423 INFO L226 Difference]: Without dead ends: 402 [2023-11-22 17:01:08,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=87, Invalid=507, Unknown=6, NotChecked=0, Total=600 [2023-11-22 17:01:08,423 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 370 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 37 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:08,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 775 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2029 Invalid, 39 Unknown, 0 Unchecked, 34.9s Time] [2023-11-22 17:01:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-11-22 17:01:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 343. [2023-11-22 17:01:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 256 states have (on average 1.58203125) internal successors, (405), 320 states have internal predecessors, (405), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-22 17:01:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 447 transitions. [2023-11-22 17:01:08,430 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 447 transitions. Word has length 32 [2023-11-22 17:01:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:08,430 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 447 transitions. [2023-11-22 17:01:08,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 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) [2023-11-22 17:01:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 447 transitions. [2023-11-22 17:01:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 17:01:08,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:08,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:08,439 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 (24)] Forceful destruction successful, exit code 0 [2023-11-22 17:01:08,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:01:08,637 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 17:01:08,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1427395780, now seen corresponding path program 1 times [2023-11-22 17:01:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:01:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873072712] [2023-11-22 17:01:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:08,639 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 [2023-11-22 17:01:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:01:08,640 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:01:08,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-22 17:01:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:08,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-22 17:01:08,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:01:09,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:01:09,177 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 [2023-11-22 17:01:09,423 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 [2023-11-22 17:01:09,499 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 [2023-11-22 17:01:14,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2023-11-22 17:01:14,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2023-11-22 17:01:14,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-22 17:01:14,319 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2023-11-22 17:01:14,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:01:14,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-11-22 17:01:14,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-11-22 17:01:14,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-22 17:01:15,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:01:15,012 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 17 treesize of output 12 [2023-11-22 17:01:15,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 17:01:15,456 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 17:01:15,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2023-11-22 17:01:15,500 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 31 treesize of output 16 [2023-11-22 17:01:18,279 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-11-22 17:01:18,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 20 [2023-11-22 17:01:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:01:18,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:01:18,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:01:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873072712] [2023-11-22 17:01:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873072712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:01:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:01:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-22 17:01:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277651500] [2023-11-22 17:01:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:01:18,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 17:01:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:01:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 17:01:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=266, Unknown=1, NotChecked=0, Total=306 [2023-11-22 17:01:18,590 INFO L87 Difference]: Start difference. First operand 343 states and 447 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:01:51,193 INFO L93 Difference]: Finished difference Result 401 states and 481 transitions. [2023-11-22 17:01:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-22 17:01:51,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-11-22 17:01:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:01:51,197 INFO L225 Difference]: With dead ends: 401 [2023-11-22 17:01:51,198 INFO L226 Difference]: Without dead ends: 401 [2023-11-22 17:01:51,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=97, Invalid=604, Unknown=1, NotChecked=0, Total=702 [2023-11-22 17:01:51,198 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 366 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:01:51,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1055 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2207 Invalid, 8 Unknown, 0 Unchecked, 29.7s Time] [2023-11-22 17:01:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-22 17:01:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2023-11-22 17:01:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 256 states have (on average 1.578125) internal successors, (404), 320 states have internal predecessors, (404), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-22 17:01:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 446 transitions. [2023-11-22 17:01:51,203 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 446 transitions. Word has length 37 [2023-11-22 17:01:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:01:51,203 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 446 transitions. [2023-11-22 17:01:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:01:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2023-11-22 17:01:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-22 17:01:51,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:01:51,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:01:51,222 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 (25)] Forceful destruction successful, exit code 0 [2023-11-22 17:01:51,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:01:51,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-11-22 17:01:51,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:01:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash -953121704, now seen corresponding path program 1 times [2023-11-22 17:01:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:01:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478226588] [2023-11-22 17:01:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:01:51,412 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 [2023-11-22 17:01:51,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:01:51,413 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:01:51,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-22 17:01:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:01:51,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-22 17:01:51,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:01:51,938 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:01:51,938 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 [2023-11-22 17:01:52,240 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 [2023-11-22 17:01:52,282 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 [2023-11-22 17:01:54,052 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2023-11-22 17:01:54,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:01:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478226588] [2023-11-22 17:01:54,603 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 17:01:54,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-22 17:01:54,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:01:54,805 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (let ((.cse1 (select (select |v_#memory_$Pointer$#1.offset_157| |list_add_#in~new#1.base|) (bvadd |list_add_#in~new#1.offset| (_ bv4 32))))) (let ((.cse0 (select (select |old(#memory_$Pointer$#1.base)| |list_add_#in~head#1.base|) .cse1))) (store |old(#memory_$Pointer$#1.offset)| .cse0 (store (select |old(#memory_$Pointer$#1.offset)| .cse0) (bvadd (_ bv4 32) (select (select |old(#memory_$Pointer$#1.offset)| |list_add_#in~head#1.base|) .cse1)) |list_add_#in~new#1.offset|)))) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-22 17:01:54,809 INFO L158 Benchmark]: Toolchain (without parser) took 255332.27ms. Allocated memory was 79.7MB in the beginning and 224.4MB in the end (delta: 144.7MB). Free memory was 42.2MB in the beginning and 78.3MB in the end (delta: -36.1MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,809 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:01:54,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.66ms. Allocated memory was 79.7MB in the beginning and 125.8MB in the end (delta: 46.1MB). Free memory was 42.0MB in the beginning and 102.6MB in the end (delta: -60.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.77ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 100.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,810 INFO L158 Benchmark]: Boogie Preprocessor took 86.96ms. Allocated memory is still 125.8MB. Free memory was 100.0MB in the beginning and 94.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,810 INFO L158 Benchmark]: RCFGBuilder took 948.80ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 81.5MB in the end (delta: 13.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,810 INFO L158 Benchmark]: TraceAbstraction took 253627.01ms. Allocated memory was 125.8MB in the beginning and 224.4MB in the end (delta: 98.6MB). Free memory was 80.8MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2023-11-22 17:01:54,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.66ms. Allocated memory was 79.7MB in the beginning and 125.8MB in the end (delta: 46.1MB). Free memory was 42.0MB in the beginning and 102.6MB in the end (delta: -60.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.77ms. Allocated memory is still 125.8MB. Free memory was 102.6MB in the beginning and 100.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.96ms. Allocated memory is still 125.8MB. Free memory was 100.0MB in the beginning and 94.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 948.80ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 81.5MB in the end (delta: 13.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 253627.01ms. Allocated memory was 125.8MB in the beginning and 224.4MB in the end (delta: 98.6MB). Free memory was 80.8MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse1 (select (select |v_#memory_$Pointer$#1.offset_157| |list_add_#in~new#1.base|) (bvadd |list_add_#in~new#1.offset| (_ bv4 32))))) (let ((.cse0 (select (select |old(#memory_$Pointer$#1.base)| |list_add_#in~head#1.base|) .cse1))) (store |old(#memory_$Pointer$#1.offset)| .cse0 (store (select |old(#memory_$Pointer$#1.offset)| .cse0) (bvadd (_ bv4 32) (select (select |old(#memory_$Pointer$#1.offset)| |list_add_#in~head#1.base|) .cse1)) |list_add_#in~new#1.offset|)))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse1 (select (select |v_#memory_$Pointer$#1.offset_157| |list_add_#in~new#1.base|) (bvadd |list_add_#in~new#1.offset| (_ bv4 32))))) (let ((.cse0 (select (select |old(#memory_$Pointer$#1.base)| |list_add_#in~head#1.base|) .cse1))) (store |old(#memory_$Pointer$#1.offset)| .cse0 (store (select |old(#memory_$Pointer$#1.offset)| .cse0) (bvadd (_ bv4 32) (select (select |old(#memory_$Pointer$#1.offset)| |list_add_#in~head#1.base|) .cse1)) |list_add_#in~new#1.offset|)))): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 17:01:54,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse1 (select (select |v_#memory_$Pointer$#1.offset_157| |list_add_#in~new#1.base|) (bvadd |list_add_#in~new#1.offset| (_ bv4 32))))) (let ((.cse0 (select (select |old(#memory_$Pointer$#1.base)| |list_add_#in~head#1.base|) .cse1))) (store |old(#memory_$Pointer$#1.offset)| .cse0 (store (select |old(#memory_$Pointer$#1.offset)| .cse0) (bvadd (_ bv4 32) (select (select |old(#memory_$Pointer$#1.offset)| |list_add_#in~head#1.base|) .cse1)) |list_add_#in~new#1.offset|))))