./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0102-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:20:48,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:20:48,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:20:48,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:20:48,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:20:48,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:20:48,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:20:48,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:20:48,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:20:48,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:20:48,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:20:48,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:20:48,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:20:48,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:20:48,743 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:20:48,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:20:48,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:20:48,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:20:48,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:20:48,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:20:48,745 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:20:48,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:20:48,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:20:48,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:20:48,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:20:48,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:20:48,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:20:48,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:20:48,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:20:48,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:20:48,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:20:48,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:20:48,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:20:48,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:20:48,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:20:48,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:20:48,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:20:48,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:20:48,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:20:48,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:20:48,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:20:48,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:20:48,754 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2024-11-12 13:20:48,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:20:49,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:20:49,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:20:49,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:20:49,028 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:20:49,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-1.i [2024-11-12 13:20:50,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:20:50,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:20:50,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2024-11-12 13:20:50,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda9f8540/dfe6a6056d64474b86bf694bc55ee3ed/FLAG4954627ca [2024-11-12 13:20:50,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda9f8540/dfe6a6056d64474b86bf694bc55ee3ed [2024-11-12 13:20:50,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:20:50,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:20:50,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:20:50,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:20:50,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:20:50,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:50" (1/1) ... [2024-11-12 13:20:50,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab8e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:50, skipping insertion in model container [2024-11-12 13:20:50,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:50" (1/1) ... [2024-11-12 13:20:50,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:20:51,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:20:51,173 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 13:20:51,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1faca4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:51, skipping insertion in model container [2024-11-12 13:20:51,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:20:51,174 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:20:51,176 INFO L158 Benchmark]: Toolchain (without parser) took 405.98ms. Allocated memory is still 184.5MB. Free memory was 125.7MB in the beginning and 111.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:20:51,177 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:20:51,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.00ms. Allocated memory is still 184.5MB. Free memory was 125.3MB in the beginning and 111.5MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:20:51,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.00ms. Allocated memory is still 184.5MB. Free memory was 125.3MB in the beginning and 111.5MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:20:53,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:20:53,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 13:20:53,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:20:53,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:20:53,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:20:53,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:20:53,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:20:53,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:20:53,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:20:53,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:20:53,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:20:53,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:20:53,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:20:53,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:20:53,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:20:53,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:20:53,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:20:53,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:20:53,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:20:53,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:20:53,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:20:53,364 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:20:53,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:20:53,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:20:53,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:20:53,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:20:53,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:20:53,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:20:53,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:20:53,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:20:53,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:20:53,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:20:53,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:20:53,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:20:53,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:20:53,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:20:53,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:20:53,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:20:53,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:20:53,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:20:53,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:20:53,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:20:53,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:20:53,371 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2024-11-12 13:20:53,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:20:53,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:20:53,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:20:53,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:20:53,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:20:53,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-1.i [2024-11-12 13:20:55,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:20:55,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:20:55,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2024-11-12 13:20:55,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae47ec9f/ec0b029507174c04b6698fb4ba248686/FLAGa0b7dd7f5 [2024-11-12 13:20:55,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae47ec9f/ec0b029507174c04b6698fb4ba248686 [2024-11-12 13:20:55,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:20:55,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:20:55,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:20:55,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:20:55,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:20:55,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:55" (1/1) ... [2024-11-12 13:20:55,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21158211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:55, skipping insertion in model container [2024-11-12 13:20:55,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:20:55" (1/1) ... [2024-11-12 13:20:55,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:20:56,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:20:56,041 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:20:56,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:20:56,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:20:56,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:20:56,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:20:56,194 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:20:56,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56 WrapperNode [2024-11-12 13:20:56,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:20:56,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:20:56,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:20:56,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:20:56,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,267 INFO L138 Inliner]: procedures = 136, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2024-11-12 13:20:56,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:20:56,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:20:56,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:20:56,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:20:56,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,319 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2024-11-12 13:20:56,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:20:56,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:20:56,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:20:56,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:20:56,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (1/1) ... [2024-11-12 13:20:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:20:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:20:56,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:20:56,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2024-11-12 13:20:56,453 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2024-11-12 13:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:20:56,453 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2024-11-12 13:20:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2024-11-12 13:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:20:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sub [2024-11-12 13:20:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sub [2024-11-12 13:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 13:20:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 13:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:20:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:20:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 13:20:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 13:20:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:20:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:20:56,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:20:56,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:20:57,048 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-12 13:20:57,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:20:57,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:20:57,072 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:20:57,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:57 BoogieIcfgContainer [2024-11-12 13:20:57,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:20:57,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:20:57,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:20:57,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:20:57,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:20:55" (1/3) ... [2024-11-12 13:20:57,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e22e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:57, skipping insertion in model container [2024-11-12 13:20:57,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:20:56" (2/3) ... [2024-11-12 13:20:57,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e22e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:20:57, skipping insertion in model container [2024-11-12 13:20:57,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:20:57" (3/3) ... [2024-11-12 13:20:57,083 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2024-11-12 13:20:57,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:20:57,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-12 13:20:57,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:20:57,160 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@73d6555f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:20:57,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-12 13:20:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 79 states have internal predecessors, (89), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:20:57,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:57,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:20:57,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 106967627, now seen corresponding path program 1 times [2024-11-12 13:20:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24085449] [2024-11-12 13:20:57,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:57,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:57,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:57,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:57,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 13:20:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:57,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 13:20:57,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:57,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:20:57,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:20:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24085449] [2024-11-12 13:20:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24085449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:20:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:20:57,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:20:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389362281] [2024-11-12 13:20:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:20:57,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:20:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:20:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:20:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:20:57,377 INFO L87 Difference]: Start difference. First operand has 89 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 79 states have internal predecessors, (89), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:20:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:57,397 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-11-12 13:20:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:20:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:20:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:57,406 INFO L225 Difference]: With dead ends: 89 [2024-11-12 13:20:57,407 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:20:57,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:20:57,411 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:57,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:20:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:20:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 13:20:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 77 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-12 13:20:57,459 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 5 [2024-11-12 13:20:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-12 13:20:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:20:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-12 13:20:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:20:57,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:57,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:20:57,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 13:20:57,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:57,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -302269748, now seen corresponding path program 1 times [2024-11-12 13:20:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499805437] [2024-11-12 13:20:57,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:57,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 13:20:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:57,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:20:57,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:57,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:20:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:57,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:20:57,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:20:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499805437] [2024-11-12 13:20:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499805437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:20:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:20:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:20:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078752103] [2024-11-12 13:20:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:20:57,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:20:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:20:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:20:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:20:57,922 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 5 states, 4 states have (on average 1.5) 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) [2024-11-12 13:20:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:58,176 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-12 13:20:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:20:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) 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 [2024-11-12 13:20:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:58,178 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:20:58,179 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:20:58,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:20:58,180 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:58,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 206 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:20:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:20:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:20:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 75 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-12 13:20:58,193 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 7 [2024-11-12 13:20:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:58,193 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-12 13:20:58,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) 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) [2024-11-12 13:20:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-12 13:20:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:20:58,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:58,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:20:58,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 13:20:58,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:58,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash -302269747, now seen corresponding path program 1 times [2024-11-12 13:20:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633794441] [2024-11-12 13:20:58,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:58,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:58,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:58,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:58,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 13:20:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:58,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:20:58,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:58,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:20:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:58,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:20:58,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:20:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633794441] [2024-11-12 13:20:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633794441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:20:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:20:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:20:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477349618] [2024-11-12 13:20:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:20:58,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:20:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:20:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:20:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:20:58,600 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 1.5) 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) [2024-11-12 13:20:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:58,856 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-11-12 13:20:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:20:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) 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 [2024-11-12 13:20:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:58,858 INFO L225 Difference]: With dead ends: 89 [2024-11-12 13:20:58,858 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 13:20:58,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:20:58,859 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:58,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 263 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:20:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 13:20:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-12 13:20:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.64) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-11-12 13:20:58,870 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 7 [2024-11-12 13:20:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-11-12 13:20:58,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) 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) [2024-11-12 13:20:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-11-12 13:20:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:20:58,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:58,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:20:58,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:20:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1061333452, now seen corresponding path program 1 times [2024-11-12 13:20:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464288620] [2024-11-12 13:20:59,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:59,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:59,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 13:20:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:59,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:20:59,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:59,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:20:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:59,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:20:59,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:20:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464288620] [2024-11-12 13:20:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464288620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:20:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:20:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:20:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663429710] [2024-11-12 13:20:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:20:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:20:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:20:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:20:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:20:59,178 INFO L87 Difference]: Start difference. First operand 88 states and 94 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) [2024-11-12 13:20:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:59,278 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-12 13:20:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:20:59,279 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 [2024-11-12 13:20:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:59,285 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:20:59,285 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:20:59,285 INFO L434 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 [2024-11-12 13:20:59,286 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:59,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:20:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:20:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 13:20:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.62) internal successors, (81), 76 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-12 13:20:59,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 11 [2024-11-12 13:20:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:59,293 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-12 13:20:59,293 INFO L472 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) [2024-11-12 13:20:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-12 13:20:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:20:59,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:59,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:20:59,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 13:20:59,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:59,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1061333451, now seen corresponding path program 1 times [2024-11-12 13:20:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141458324] [2024-11-12 13:20:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:59,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:59,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 13:20:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:59,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:20:59,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:59,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:20:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:59,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:20:59,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:20:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141458324] [2024-11-12 13:20:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141458324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:20:59,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:20:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:20:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312950261] [2024-11-12 13:20:59,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:20:59,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:20:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:20:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:20:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:20:59,638 INFO L87 Difference]: Start difference. First operand 87 states and 93 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) [2024-11-12 13:20:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:59,769 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-12 13:20:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:20:59,770 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 [2024-11-12 13:20:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:59,771 INFO L225 Difference]: With dead ends: 86 [2024-11-12 13:20:59,771 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 13:20:59,771 INFO L434 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 [2024-11-12 13:20:59,772 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:59,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 145 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:20:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 13:20:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 13:20:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.6) internal successors, (80), 75 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:20:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-12 13:20:59,779 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 11 [2024-11-12 13:20:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-12 13:20:59,779 INFO L472 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) [2024-11-12 13:20:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-12 13:20:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:20:59,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:59,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:20:59,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 13:20:59,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:20:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1364475199, now seen corresponding path program 1 times [2024-11-12 13:20:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:20:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065252190] [2024-11-12 13:20:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:20:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:20:59,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:20:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 13:21:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:00,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:21:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:00,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:00,189 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:21:00,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 13:21:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:00,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:00,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065252190] [2024-11-12 13:21:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065252190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707193476] [2024-11-12 13:21:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:00,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:00,308 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:00,820 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-12 13:21:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:21:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 13:21:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:00,821 INFO L225 Difference]: With dead ends: 105 [2024-11-12 13:21:00,821 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 13:21:00,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:00,823 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:00,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 310 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 13:21:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2024-11-12 13:21:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 84 states have internal predecessors, (98), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:21:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-12 13:21:00,837 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 14 [2024-11-12 13:21:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:00,837 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-12 13:21:00,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-12 13:21:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:21:00,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:00,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:00,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 13:21:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:01,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1364475200, now seen corresponding path program 1 times [2024-11-12 13:21:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561645306] [2024-11-12 13:21:01,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:01,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:01,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:01,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:01,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 13:21:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:01,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 13:21:01,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:01,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:01,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:01,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:01,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:21:01,300 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:01,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:01,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:01,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561645306] [2024-11-12 13:21:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561645306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:01,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419537780] [2024-11-12 13:21:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:01,384 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:01,902 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-11-12 13:21:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 13:21:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:01,903 INFO L225 Difference]: With dead ends: 123 [2024-11-12 13:21:01,903 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 13:21:01,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:01,904 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:01,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 342 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 13:21:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2024-11-12 13:21:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.64) internal successors, (123), 101 states have internal predecessors, (123), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:21:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2024-11-12 13:21:01,911 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 14 [2024-11-12 13:21:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:01,911 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2024-11-12 13:21:01,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2024-11-12 13:21:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:21:01,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:01,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:01,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 13:21:02,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:02,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1295642112, now seen corresponding path program 1 times [2024-11-12 13:21:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452165019] [2024-11-12 13:21:02,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:02,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:02,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 13:21:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:02,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:21:02,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:02,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:02,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452165019] [2024-11-12 13:21:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452165019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780275140] [2024-11-12 13:21:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:02,260 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:02,392 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2024-11-12 13:21:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:02,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:21:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:02,394 INFO L225 Difference]: With dead ends: 114 [2024-11-12 13:21:02,394 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 13:21:02,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:02,395 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:02,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 13:21:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-12 13:21:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6) internal successors, (120), 100 states have internal predecessors, (120), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:21:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2024-11-12 13:21:02,401 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 16 [2024-11-12 13:21:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:02,401 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2024-11-12 13:21:02,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2024-11-12 13:21:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:21:02,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:02,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:02,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 13:21:02,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:02,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1295642113, now seen corresponding path program 1 times [2024-11-12 13:21:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043993170] [2024-11-12 13:21:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:02,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:02,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:02,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 13:21:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:02,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:21:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:02,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:02,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043993170] [2024-11-12 13:21:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043993170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:02,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:21:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722627763] [2024-11-12 13:21:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:02,841 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:03,146 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2024-11-12 13:21:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:21:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:21:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:03,148 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:21:03,148 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:21:03,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:03,149 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:03,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 632 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:21:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-12 13:21:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.5866666666666667) internal successors, (119), 100 states have internal predecessors, (119), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:21:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2024-11-12 13:21:03,154 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 16 [2024-11-12 13:21:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:03,154 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2024-11-12 13:21:03,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2024-11-12 13:21:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:03,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:03,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:03,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:03,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:03,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1510199848, now seen corresponding path program 1 times [2024-11-12 13:21:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050033785] [2024-11-12 13:21:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:03,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:03,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 13:21:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:03,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:21:03,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:03,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:03,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:03,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050033785] [2024-11-12 13:21:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050033785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012267359] [2024-11-12 13:21:03,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:03,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:03,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:03,537 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:03,774 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-11-12 13:21:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 13:21:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:03,775 INFO L225 Difference]: With dead ends: 119 [2024-11-12 13:21:03,775 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 13:21:03,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:03,776 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:03,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 276 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 13:21:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-11-12 13:21:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.52) internal successors, (114), 99 states have internal predecessors, (114), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:21:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2024-11-12 13:21:03,781 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 17 [2024-11-12 13:21:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:03,781 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2024-11-12 13:21:03,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2024-11-12 13:21:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:03,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:03,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:03,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:03,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:03,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1510199849, now seen corresponding path program 1 times [2024-11-12 13:21:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463282124] [2024-11-12 13:21:03,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:03,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:03,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:03,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:03,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 13:21:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:04,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:21:04,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:04,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:04,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:04,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463282124] [2024-11-12 13:21:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463282124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:04,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122325295] [2024-11-12 13:21:04,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:04,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:04,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:04,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:04,185 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:04,425 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2024-11-12 13:21:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 13:21:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:04,427 INFO L225 Difference]: With dead ends: 117 [2024-11-12 13:21:04,427 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 13:21:04,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:04,428 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:04,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 291 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 13:21:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-11-12 13:21:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 99 states have internal predecessors, (110), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 13:21:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2024-11-12 13:21:04,432 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 17 [2024-11-12 13:21:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2024-11-12 13:21:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2024-11-12 13:21:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:21:04,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:04,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:04,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 13:21:04,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:04,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:04,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:04,638 INFO L85 PathProgramCache]: Analyzing trace with hash -396890741, now seen corresponding path program 1 times [2024-11-12 13:21:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347093681] [2024-11-12 13:21:04,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:04,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 [2024-11-12 13:21:04,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:04,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:04,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 (13)] Waiting until timeout for monitored process [2024-11-12 13:21:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:04,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:21:04,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:04,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:04,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:21:04,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:21:04,955 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:04,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:05,004 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 25 treesize of output 18 [2024-11-12 13:21:05,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:05,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-12 13:21:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:05,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:05,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:05,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347093681] [2024-11-12 13:21:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347093681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:05,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:05,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138937045] [2024-11-12 13:21:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:05,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:05,150 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:05,846 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2024-11-12 13:21:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:21:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:05,849 INFO L225 Difference]: With dead ends: 137 [2024-11-12 13:21:05,849 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 13:21:05,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:21:05,850 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:05,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 542 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:21:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 13:21:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-12 13:21:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 119 states have internal predecessors, (134), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:21:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-11-12 13:21:05,856 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 19 [2024-11-12 13:21:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:05,857 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-11-12 13:21:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-11-12 13:21:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:21:05,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:05,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:05,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 13:21:06,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:06,058 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash -396890740, now seen corresponding path program 1 times [2024-11-12 13:21:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309747654] [2024-11-12 13:21:06,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:06,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:06,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 13:21:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:06,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:21:06,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:06,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:06,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:06,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:06,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:21:06,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:06,459 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:06,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:06,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:21:06,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:21:06,532 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 [2024-11-12 13:21:06,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 13:21:06,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:06,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:06,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309747654] [2024-11-12 13:21:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309747654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:06,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613834686] [2024-11-12 13:21:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:06,735 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:07,710 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-11-12 13:21:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:21:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:07,711 INFO L225 Difference]: With dead ends: 135 [2024-11-12 13:21:07,711 INFO L226 Difference]: Without dead ends: 135 [2024-11-12 13:21:07,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:21:07,712 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:07,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 469 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-12 13:21:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-12 13:21:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.4) internal successors, (133), 119 states have internal predecessors, (133), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 13:21:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2024-11-12 13:21:07,717 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 19 [2024-11-12 13:21:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:07,717 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2024-11-12 13:21:07,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:21:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2024-11-12 13:21:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:21:07,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:07,718 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:07,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 13:21:07,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:07,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash -944445774, now seen corresponding path program 1 times [2024-11-12 13:21:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511795259] [2024-11-12 13:21:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:07,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:07,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:07,921 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:07,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 13:21:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:08,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:21:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:08,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:08,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:08,155 WARN L873 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)) (= (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|)) |c_#length|))) is different from true [2024-11-12 13:21:08,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:21:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:08,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:21:08,239 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:08,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:08,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:08,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511795259] [2024-11-12 13:21:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511795259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1560035696] [2024-11-12 13:21:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:21:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:21:08,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:21:08,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-12 13:21:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:08,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:21:08,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:08,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:08,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:09,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:21:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:09,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:21:09,294 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:09,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:09,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:09,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1560035696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:09,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:21:09,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2024-11-12 13:21:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998390730] [2024-11-12 13:21:09,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=265, Unknown=1, NotChecked=32, Total=342 [2024-11-12 13:21:09,612 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:21:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:10,749 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2024-11-12 13:21:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:10,750 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-11-12 13:21:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:10,752 INFO L225 Difference]: With dead ends: 165 [2024-11-12 13:21:10,752 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 13:21:10,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2024-11-12 13:21:10,753 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:10,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 314 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 627 Invalid, 0 Unknown, 113 Unchecked, 0.9s Time] [2024-11-12 13:21:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 13:21:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2024-11-12 13:21:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 125 states have internal predecessors, (141), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-12 13:21:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2024-11-12 13:21:10,761 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 30 [2024-11-12 13:21:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:10,763 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2024-11-12 13:21:10,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:21:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2024-11-12 13:21:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:21:10,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:10,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:10,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-12 13:21:10,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 13:21:11,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:11,165 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:11,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2072914501, now seen corresponding path program 1 times [2024-11-12 13:21:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880853318] [2024-11-12 13:21:11,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:11,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:11,172 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:11,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 13:21:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:11,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 13:21:11,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:11,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:21:11,700 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:21:11,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:21:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:11,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:12,902 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 52 treesize of output 48 [2024-11-12 13:21:13,176 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-12 13:21:13,176 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 16 treesize of output 15 [2024-11-12 13:21:13,198 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-12 13:21:13,198 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 16 treesize of output 15 [2024-11-12 13:21:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:13,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880853318] [2024-11-12 13:21:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880853318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:21:13,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:21:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2024-11-12 13:21:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353604280] [2024-11-12 13:21:13,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:21:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:21:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:21:13,213 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:21:17,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-12 13:21:22,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-12 13:21:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,563 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2024-11-12 13:21:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:21:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-11-12 13:21:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,565 INFO L225 Difference]: With dead ends: 148 [2024-11-12 13:21:23,565 INFO L226 Difference]: Without dead ends: 148 [2024-11-12 13:21:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 13:21:23,568 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 901 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-12 13:21:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-12 13:21:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2024-11-12 13:21:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 123 states have internal predecessors, (137), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-12 13:21:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2024-11-12 13:21:23,577 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 37 [2024-11-12 13:21:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,577 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2024-11-12 13:21:23,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:21:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2024-11-12 13:21:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:21:23,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:23,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-12 13:21:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:23,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1158317137, now seen corresponding path program 1 times [2024-11-12 13:21:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312243497] [2024-11-12 13:21:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:23,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:23,781 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:23,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 13:21:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-12 13:21:24,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:24,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:24,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:24,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:24,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:21:24,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:24,306 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:21:24,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:21:24,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:21:24,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-12 13:21:24,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:24,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2024-11-12 13:21:25,295 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-12 13:21:25,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 97 [2024-11-12 13:21:25,300 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 77 treesize of output 56 [2024-11-12 13:21:25,310 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 55 treesize of output 20 [2024-11-12 13:21:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:25,517 INFO L349 Elim1Store]: treesize reduction 148, result has 26.4 percent of original size [2024-11-12 13:21:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 44 treesize of output 83 [2024-11-12 13:21:25,718 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 36 treesize of output 27 [2024-11-12 13:21:26,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-12 13:21:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:31,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:31,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312243497] [2024-11-12 13:21:31,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312243497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:31,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1887420668] [2024-11-12 13:21:31,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:21:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:21:31,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:21:31,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-12 13:21:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-12 13:21:32,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:32,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:32,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:32,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:32,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:21:32,360 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:21:32,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:21:32,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:21:32,447 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 [2024-11-12 13:21:32,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:32,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:32,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:32,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2024-11-12 13:21:33,028 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-12 13:21:33,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 97 [2024-11-12 13:21:33,037 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 77 treesize of output 56 [2024-11-12 13:21:33,050 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 55 treesize of output 26 [2024-11-12 13:21:33,242 INFO L349 Elim1Store]: treesize reduction 156, result has 25.4 percent of original size [2024-11-12 13:21:33,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 76 [2024-11-12 13:21:33,470 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 36 treesize of output 27 [2024-11-12 13:21:33,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-12 13:21:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:35,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:35,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_827) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|)))))) is different from false [2024-11-12 13:21:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1887420668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:36,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:21:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2024-11-12 13:21:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348867715] [2024-11-12 13:21:36,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-12 13:21:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:21:36,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 13:21:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1327, Unknown=32, NotChecked=74, Total=1560 [2024-11-12 13:21:36,326 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 29 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:41,546 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2024-11-12 13:21:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:21:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-12 13:21:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:41,549 INFO L225 Difference]: With dead ends: 158 [2024-11-12 13:21:41,549 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 13:21:41,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=295, Invalid=2752, Unknown=37, NotChecked=108, Total=3192 [2024-11-12 13:21:41,551 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:41,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 885 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-12 13:21:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 13:21:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-11-12 13:21:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-12 13:21:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2024-11-12 13:21:41,557 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 36 [2024-11-12 13:21:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2024-11-12 13:21:41,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:21:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2024-11-12 13:21:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:21:41,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:41,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:41,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:41,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:41,960 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:21:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1158317136, now seen corresponding path program 1 times [2024-11-12 13:21:41,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:21:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477690628] [2024-11-12 13:21:41,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:21:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:21:41,963 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:21:41,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-12 13:21:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:42,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-12 13:21:42,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:42,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:42,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:42,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:21:42,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:42,443 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:21:42,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:21:42,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:42,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:21:42,614 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 [2024-11-12 13:21:42,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:42,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:44,472 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2024-11-12 13:21:44,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:44,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-12 13:21:44,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 50 [2024-11-12 13:21:44,521 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-12 13:21:44,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 104 [2024-11-12 13:21:44,529 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 96 treesize of output 69 [2024-11-12 13:21:44,547 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 18 [2024-11-12 13:21:44,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:44,915 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:21:44,916 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 [2024-11-12 13:21:44,974 INFO L349 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2024-11-12 13:21:44,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 44 [2024-11-12 13:21:45,166 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-12 13:21:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 84 [2024-11-12 13:21:45,176 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 23 treesize of output 16 [2024-11-12 13:21:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:21:45,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:45,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:46,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_953) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_953) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_954) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2024-11-12 13:21:51,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:21:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477690628] [2024-11-12 13:21:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477690628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726899131] [2024-11-12 13:21:51,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:21:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:21:51,636 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:21:51,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-12 13:21:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-12 13:21:52,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:52,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:21:52,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:52,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:21:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:52,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:21:52,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:21:52,547 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:21:52,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:21:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:21:52,684 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 [2024-11-12 13:21:52,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:52,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:21:56,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2024-11-12 13:21:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-12 13:21:56,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2024-11-12 13:21:56,740 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-12 13:21:56,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 104 [2024-11-12 13:21:56,744 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 84 treesize of output 61 [2024-11-12 13:21:56,767 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 55 treesize of output 26 [2024-11-12 13:21:56,773 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 18 [2024-11-12 13:21:57,186 INFO L349 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2024-11-12 13:21:57,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 44 [2024-11-12 13:21:57,202 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:21:57,202 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 [2024-11-12 13:21:57,448 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 [2024-11-12 13:21:57,459 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 23 treesize of output 16 [2024-11-12 13:21:57,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:57,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:21:57,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:21:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:57,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1726899131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:03,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2024-11-12 13:22:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096536502] [2024-11-12 13:22:03,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:22:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:22:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:22:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1484, Unknown=31, NotChecked=78, Total=1722 [2024-11-12 13:22:03,587 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 32 states, 30 states have (on average 1.6) internal successors, (48), 29 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:22:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:15,284 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2024-11-12 13:22:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:22:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6) internal successors, (48), 29 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-12 13:22:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:15,286 INFO L225 Difference]: With dead ends: 159 [2024-11-12 13:22:15,286 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 13:22:15,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=226, Invalid=2498, Unknown=36, NotChecked=102, Total=2862 [2024-11-12 13:22:15,287 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 16 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:15,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 725 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 932 Invalid, 7 Unknown, 0 Unchecked, 4.8s Time] [2024-11-12 13:22:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 13:22:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-12 13:22:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 139 states have internal predecessors, (151), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-12 13:22:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2024-11-12 13:22:15,293 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 36 [2024-11-12 13:22:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:15,294 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2024-11-12 13:22:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6) internal successors, (48), 29 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:22:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2024-11-12 13:22:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 13:22:15,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:15,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-12 13:22:15,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-12 13:22:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:22:15,696 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:22:15,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 793990076, now seen corresponding path program 1 times [2024-11-12 13:22:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:22:15,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049110795] [2024-11-12 13:22:15,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:22:15,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:22:15,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:22:15,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-12 13:22:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:15,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:22:15,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:15,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:22:15,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:22:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049110795] [2024-11-12 13:22:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049110795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:15,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:22:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674837687] [2024-11-12 13:22:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:15,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:22:15,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:22:15,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:22:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:22:15,984 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:22:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:16,266 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-12 13:22:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:22:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-12 13:22:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:16,268 INFO L225 Difference]: With dead ends: 161 [2024-11-12 13:22:16,268 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 13:22:16,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:22:16,269 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:16,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 694 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:22:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 13:22:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-12 13:22:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 139 states have internal predecessors, (149), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-12 13:22:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2024-11-12 13:22:16,274 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 39 [2024-11-12 13:22:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:16,275 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2024-11-12 13:22:16,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:22:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2024-11-12 13:22:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:22:16,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:16,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:16,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-12 13:22:16,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:22:16,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-12 13:22:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1373465073, now seen corresponding path program 1 times [2024-11-12 13:22:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:22:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384895576] [2024-11-12 13:22:16,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:22:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:22:16,481 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:22:16,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-12 13:22:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-12 13:22:16,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:16,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:22:16,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:22:16,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:22:16,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:22:17,049 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:22:17,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2024-11-12 13:22:17,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:22:17,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:22:17,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:17,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-12 13:22:17,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:22:17,438 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:22:17,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:22:17,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:22:17,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:22:17,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 13:22:17,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:22:17,687 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:22:17,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:22:17,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:22:17,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:22:17,804 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 [2024-11-12 13:22:17,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:22:18,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 13:22:18,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:22:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:18,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:18,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1311) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1310) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1311) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2024-11-12 13:22:19,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:19,786 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 2 case distinctions, treesize of input 54 treesize of output 60 [2024-11-12 13:22:19,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:19,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 86 [2024-11-12 13:22:19,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:19,820 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 2 case distinctions, treesize of input 78 treesize of output 70 [2024-11-12 13:22:19,826 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 108 treesize of output 90 [2024-11-12 13:22:19,836 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 22 treesize of output 18 [2024-11-12 13:22:19,846 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 14 [2024-11-12 13:22:19,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:19,972 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 2 case distinctions, treesize of input 49 treesize of output 42 [2024-11-12 13:22:19,978 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 50 treesize of output 32 [2024-11-12 13:22:19,987 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 17 treesize of output 9 [2024-11-12 13:22:21,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:21,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 123