./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/ldv-memsafety/memleaks_test23_2.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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:21,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:21,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:52:21,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:21,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:21,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:21,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:21,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:21,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:21,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:21,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:21,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:21,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:21,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:21,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:21,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:21,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:21,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:21,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:21,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:21,623 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:21,627 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:21,628 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:21,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:21,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:21,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:21,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:21,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:21,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:21,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:21,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:21,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:21,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:21,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:21,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:21,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:21,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:52:21,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:52:21,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:21,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:21,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:21,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:21,635 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-09 07:52:21,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:21,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:21,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:21,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:21,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:21,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-09 07:52:23,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:23,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:23,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-09 07:52:23,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffe11047/9976c010f2a44e4c8f1804e9476244d6/FLAG618cd512e [2024-11-09 07:52:23,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffe11047/9976c010f2a44e4c8f1804e9476244d6 [2024-11-09 07:52:23,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:23,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:23,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:23,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:23,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:23,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:23" (1/1) ... [2024-11-09 07:52:23,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7a1d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:23, skipping insertion in model container [2024-11-09 07:52:23,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:23" (1/1) ... [2024-11-09 07:52:24,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:24,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:24,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:24,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:24,505 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-09 07:52:24,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@74a9d5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:24, skipping insertion in model container [2024-11-09 07:52:24,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:24,508 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:52:24,510 INFO L158 Benchmark]: Toolchain (without parser) took 536.46ms. Allocated memory is still 144.7MB. Free memory was 91.3MB in the beginning and 73.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:24,510 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:52:24,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.15ms. Allocated memory is still 144.7MB. Free memory was 91.3MB in the beginning and 74.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:52:24,512 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 144.7MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.15ms. Allocated memory is still 144.7MB. Free memory was 91.3MB in the beginning and 74.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test23_2.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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:52:26,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:52:26,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:52:26,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:52:26,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:52:26,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:52:26,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:52:26,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:52:26,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:52:26,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:52:26,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:52:26,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:52:26,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:52:26,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:52:26,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:52:26,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:52:26,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:52:26,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:52:26,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:52:26,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:52:26,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:52:26,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:52:26,695 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:52:26,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:52:26,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:52:26,696 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:52:26,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:52:26,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:52:26,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:52:26,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:52:26,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:52:26,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:52:26,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:52:26,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:52:26,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:52:26,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:26,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:52:26,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:52:26,700 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:52:26,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:52:26,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:52:26,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:52:26,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:52:26,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:52:26,702 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-09 07:52:27,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:52:27,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:52:27,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:52:27,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:52:27,049 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:52:27,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-09 07:52:28,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:52:28,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:52:28,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-09 07:52:29,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55158933b/8983fa177c764e5bbf9d621ec1fe03a3/FLAG82db5e903 [2024-11-09 07:52:29,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55158933b/8983fa177c764e5bbf9d621ec1fe03a3 [2024-11-09 07:52:29,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:52:29,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:52:29,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:29,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:52:29,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:52:29,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50309668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29, skipping insertion in model container [2024-11-09 07:52:29,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:29,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:29,577 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:29,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:29,605 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:52:29,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:52:29,641 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:29,682 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:52:29,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:29,692 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:52:29,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:52:29,823 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:52:29,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29 WrapperNode [2024-11-09 07:52:29,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:52:29,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:29,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:52:29,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:52:29,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,907 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 200 [2024-11-09 07:52:29,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:52:29,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:52:29,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:52:29,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:52:29,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,987 INFO L175 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 29, 5]. 81 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 17 writes are split as follows [0, 13, 4]. [2024-11-09 07:52:29,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:29,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:52:30,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:52:30,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:52:30,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:52:30,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (1/1) ... [2024-11-09 07:52:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:52:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:52:30,088 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-09 07:52:30,096 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-09 07:52:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:52:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:52:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:52:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:52:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 07:52:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 07:52:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:52:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:52:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:52:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-11-09 07:52:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:52:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:52:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:52:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:52:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:52:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:52:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-09 07:52:30,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-09 07:52:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-09 07:52:30,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-09 07:52:30,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:52:30,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:52:30,337 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:52:30,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:52:31,197 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-09 07:52:31,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:52:31,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:52:31,217 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:52:31,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:31 BoogieIcfgContainer [2024-11-09 07:52:31,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:52:31,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:52:31,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:52:31,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:52:31,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:52:29" (1/3) ... [2024-11-09 07:52:31,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:31, skipping insertion in model container [2024-11-09 07:52:31,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:52:29" (2/3) ... [2024-11-09 07:52:31,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:52:31, skipping insertion in model container [2024-11-09 07:52:31,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:52:31" (3/3) ... [2024-11-09 07:52:31,231 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2024-11-09 07:52:31,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:52:31,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-09 07:52:31,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:52:31,317 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;@5a4753b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:52:31,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-09 07:52:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:52:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:31,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:31,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:31,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:31,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1281398167, now seen corresponding path program 1 times [2024-11-09 07:52:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134876374] [2024-11-09 07:52:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:31,356 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-09 07:52:31,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:31,359 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-09 07:52:31,382 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-09 07:52:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:31,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:31,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:31,573 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-09 07:52:31,659 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-09 07:52:31,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:31,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134876374] [2024-11-09 07:52:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134876374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:31,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129078991] [2024-11-09 07:52:31,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:52:31,701 INFO L87 Difference]: Start difference. First operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:32,441 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2024-11-09 07:52:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:32,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:32,453 INFO L225 Difference]: With dead ends: 220 [2024-11-09 07:52:32,453 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 07:52:32,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:32,459 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:32,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 842 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:52:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 07:52:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2024-11-09 07:52:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.793103448275862) internal successors, (208), 194 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 07:52:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 227 transitions. [2024-11-09 07:52:32,519 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 227 transitions. Word has length 12 [2024-11-09 07:52:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:32,519 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 227 transitions. [2024-11-09 07:52:32,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 227 transitions. [2024-11-09 07:52:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:32,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:32,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:32,525 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-09 07:52:32,721 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-09 07:52:32,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:32,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1281398168, now seen corresponding path program 1 times [2024-11-09 07:52:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31865477] [2024-11-09 07:52:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:32,723 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-09 07:52:32,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:32,727 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-09 07:52:32,728 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-09 07:52:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:32,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:52:32,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:32,841 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-09 07:52:32,984 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-09 07:52:32,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:32,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31865477] [2024-11-09 07:52:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31865477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330523979] [2024-11-09 07:52:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:32,988 INFO L87 Difference]: Start difference. First operand 211 states and 227 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:33,774 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2024-11-09 07:52:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:33,777 INFO L225 Difference]: With dead ends: 215 [2024-11-09 07:52:33,777 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 07:52:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:33,779 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1098 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:52:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 07:52:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-09 07:52:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 194 states have internal predecessors, (206), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 07:52:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2024-11-09 07:52:33,795 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 12 [2024-11-09 07:52:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2024-11-09 07:52:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2024-11-09 07:52:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:33,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:33,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:33,999 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-09 07:52:34,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1270758794, now seen corresponding path program 1 times [2024-11-09 07:52:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682791109] [2024-11-09 07:52:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:34,001 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-09 07:52:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:34,004 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-09 07:52:34,005 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-09 07:52:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:34,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:52:34,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:34,140 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-09 07:52:34,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:34,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682791109] [2024-11-09 07:52:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682791109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956482890] [2024-11-09 07:52:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,145 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:34,179 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2024-11-09 07:52:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:34,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:34,181 INFO L225 Difference]: With dead ends: 202 [2024-11-09 07:52:34,181 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:52:34,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,182 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:34,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:52:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-09 07:52:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 186 states have internal predecessors, (198), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2024-11-09 07:52:34,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 12 [2024-11-09 07:52:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2024-11-09 07:52:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2024-11-09 07:52:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:34,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:34,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:34,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:52:34,393 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-09 07:52:34,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1281312215, now seen corresponding path program 1 times [2024-11-09 07:52:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953084641] [2024-11-09 07:52:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:34,399 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-09 07:52:34,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:52:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:34,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:34,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:34,508 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-09 07:52:34,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:34,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953084641] [2024-11-09 07:52:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953084641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:34,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:34,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124080526] [2024-11-09 07:52:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:34,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,510 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:34,553 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2024-11-09 07:52:34,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:34,555 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:52:34,556 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:52:34,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,557 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 104 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:34,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 705 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:52:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2024-11-09 07:52:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 186 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2024-11-09 07:52:34,576 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 12 [2024-11-09 07:52:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2024-11-09 07:52:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2024-11-09 07:52:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:52:34,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:34,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:34,584 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-09 07:52:34,777 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-09 07:52:34,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:34,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1270844746, now seen corresponding path program 1 times [2024-11-09 07:52:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850370131] [2024-11-09 07:52:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:34,779 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-09 07:52:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:34,782 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-09 07:52:34,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:52:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:34,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:34,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:34,884 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-09 07:52:34,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:34,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850370131] [2024-11-09 07:52:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850370131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:34,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:34,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660143354] [2024-11-09 07:52:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:34,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:52:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:52:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,887 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:34,913 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2024-11-09 07:52:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:52:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:52:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:34,915 INFO L225 Difference]: With dead ends: 204 [2024-11-09 07:52:34,915 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 07:52:34,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:52:34,916 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 98 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:34,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 716 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 07:52:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 07:52:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 188 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 07:52:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2024-11-09 07:52:34,924 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 12 [2024-11-09 07:52:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:34,924 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2024-11-09 07:52:34,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2024-11-09 07:52:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:52:34,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:34,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:34,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:52:35,126 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-09 07:52:35,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -741461350, now seen corresponding path program 1 times [2024-11-09 07:52:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862368724] [2024-11-09 07:52:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:35,128 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-09 07:52:35,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:35,131 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-09 07:52:35,132 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-09 07:52:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:35,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:52:35,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:35,229 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-09 07:52:35,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:35,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862368724] [2024-11-09 07:52:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862368724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:52:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030499013] [2024-11-09 07:52:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:35,231 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:35,559 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2024-11-09 07:52:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:35,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:52:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:35,561 INFO L225 Difference]: With dead ends: 216 [2024-11-09 07:52:35,561 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 07:52:35,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:35,562 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:35,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 379 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:52:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 07:52:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2024-11-09 07:52:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 183 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:52:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2024-11-09 07:52:35,570 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 13 [2024-11-09 07:52:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:35,570 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2024-11-09 07:52:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:52:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2024-11-09 07:52:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:52:35,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:35,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:35,578 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-09 07:52:35,774 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-09 07:52:35,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1483331329, now seen corresponding path program 1 times [2024-11-09 07:52:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767372994] [2024-11-09 07:52:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:35,777 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-09 07:52:35,778 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-09 07:52:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:35,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:52:35,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:35,982 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:52:36,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:36,046 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-09 07:52:36,119 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-09 07:52:36,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:36,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767372994] [2024-11-09 07:52:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767372994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:36,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:36,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652635099] [2024-11-09 07:52:36,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:36,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:52:36,123 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:36,961 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2024-11-09 07:52:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:36,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-09 07:52:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:36,963 INFO L225 Difference]: With dead ends: 248 [2024-11-09 07:52:36,963 INFO L226 Difference]: Without dead ends: 248 [2024-11-09 07:52:36,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:52:36,964 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 300 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:36,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 250 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 468 Invalid, 0 Unknown, 260 Unchecked, 0.7s Time] [2024-11-09 07:52:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-09 07:52:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 207. [2024-11-09 07:52:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 191 states have internal predecessors, (206), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 07:52:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2024-11-09 07:52:36,972 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 16 [2024-11-09 07:52:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:36,973 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2024-11-09 07:52:36,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:52:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2024-11-09 07:52:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:52:36,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:36,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:36,977 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:37,174 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-09 07:52:37,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -573508604, now seen corresponding path program 1 times [2024-11-09 07:52:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:37,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849027127] [2024-11-09 07:52:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:37,176 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-09 07:52:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:37,178 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-09 07:52:37,178 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-09 07:52:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:37,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:52:37,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:37,301 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-09 07:52:37,335 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-09 07:52:37,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:37,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849027127] [2024-11-09 07:52:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849027127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:37,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:37,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138591906] [2024-11-09 07:52:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:37,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:37,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:37,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:37,338 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:37,845 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2024-11-09 07:52:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-09 07:52:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:37,847 INFO L225 Difference]: With dead ends: 262 [2024-11-09 07:52:37,848 INFO L226 Difference]: Without dead ends: 262 [2024-11-09 07:52:37,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:37,848 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 65 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:37,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 636 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:52:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-09 07:52:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 235. [2024-11-09 07:52:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 219 states have internal predecessors, (261), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 07:52:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-09 07:52:37,858 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 25 [2024-11-09 07:52:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:37,858 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-09 07:52:37,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-09 07:52:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:52:37,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:37,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:37,865 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-09 07:52:38,061 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-09 07:52:38,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash -573508603, now seen corresponding path program 1 times [2024-11-09 07:52:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511054286] [2024-11-09 07:52:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:38,062 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-09 07:52:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:38,064 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-09 07:52:38,066 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-09 07:52:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:38,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:38,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:38,197 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-09 07:52:38,267 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-09 07:52:38,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:38,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511054286] [2024-11-09 07:52:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511054286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:52:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340422957] [2024-11-09 07:52:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:38,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:38,269 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:38,795 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2024-11-09 07:52:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-09 07:52:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:38,797 INFO L225 Difference]: With dead ends: 260 [2024-11-09 07:52:38,797 INFO L226 Difference]: Without dead ends: 260 [2024-11-09 07:52:38,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:38,798 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 62 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:38,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 671 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:52:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-09 07:52:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2024-11-09 07:52:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.7466666666666666) internal successors, (262), 219 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2024-11-09 07:52:38,808 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2024-11-09 07:52:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:38,809 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2024-11-09 07:52:38,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2024-11-09 07:52:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:52:38,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:38,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:38,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:52:39,010 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-09 07:52:39,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1385886521, now seen corresponding path program 1 times [2024-11-09 07:52:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62938061] [2024-11-09 07:52:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:39,012 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-09 07:52:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:39,015 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-09 07:52:39,018 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-09 07:52:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:39,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:52:39,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:39,145 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-09 07:52:39,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:39,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62938061] [2024-11-09 07:52:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62938061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311413911] [2024-11-09 07:52:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:39,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:52:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:52:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:39,147 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:39,227 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2024-11-09 07:52:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:52:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 07:52:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:39,231 INFO L225 Difference]: With dead ends: 236 [2024-11-09 07:52:39,232 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 07:52:39,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:52:39,233 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 81 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:39,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 855 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:52:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 07:52:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-09 07:52:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.74) internal successors, (261), 219 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2024-11-09 07:52:39,241 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 27 [2024-11-09 07:52:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2024-11-09 07:52:39,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2024-11-09 07:52:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:52:39,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:39,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:39,247 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 (11)] Ended with exit code 0 [2024-11-09 07:52:39,444 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-09 07:52:39,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -69122448, now seen corresponding path program 1 times [2024-11-09 07:52:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789178506] [2024-11-09 07:52:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:39,446 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-09 07:52:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:39,447 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-09 07:52:39,448 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-09 07:52:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:39,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:52:39,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:39,609 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-09 07:52:39,661 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:52:39,661 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-09 07:52:39,715 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-09 07:52:39,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:39,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789178506] [2024-11-09 07:52:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789178506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133605335] [2024-11-09 07:52:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:39,717 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:40,345 INFO L93 Difference]: Finished difference Result 247 states and 289 transitions. [2024-11-09 07:52:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 07:52:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:40,347 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:52:40,347 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:52:40,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:52:40,348 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 132 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:40,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 555 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:52:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:52:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2024-11-09 07:52:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 214 states have internal predecessors, (251), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2024-11-09 07:52:40,355 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 33 [2024-11-09 07:52:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:40,355 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2024-11-09 07:52:40,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2024-11-09 07:52:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:52:40,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:40,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:40,364 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-09 07:52:40,557 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-09 07:52:40,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -69122447, now seen corresponding path program 1 times [2024-11-09 07:52:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169470751] [2024-11-09 07:52:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:40,559 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-09 07:52:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:40,560 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-09 07:52:40,561 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-09 07:52:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:52:40,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:52:40,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:52:40,796 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-09 07:52:40,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:40,834 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-09 07:52:40,843 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:52:40,844 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-09 07:52:40,919 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-09 07:52:40,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:40,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169470751] [2024-11-09 07:52:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169470751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557772457] [2024-11-09 07:52:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:40,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:52:40,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:40,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:52:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-09 07:52:40,921 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:41,643 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2024-11-09 07:52:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 07:52:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:41,645 INFO L225 Difference]: With dead ends: 281 [2024-11-09 07:52:41,645 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 07:52:41,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-11-09 07:52:41,646 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:41,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 433 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 523 Invalid, 0 Unknown, 313 Unchecked, 0.7s Time] [2024-11-09 07:52:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 07:52:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 231. [2024-11-09 07:52:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.64) internal successors, (246), 214 states have internal predecessors, (246), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2024-11-09 07:52:41,652 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 33 [2024-11-09 07:52:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:41,653 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2024-11-09 07:52:41,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2024-11-09 07:52:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:41,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:41,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:41,660 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-09 07:52:41,854 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-09 07:52:41,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:41,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1938732971, now seen corresponding path program 1 times [2024-11-09 07:52:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689689772] [2024-11-09 07:52:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:41,855 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-09 07:52:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:41,856 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-09 07:52:41,864 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-09 07:52:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:41,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:52:41,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:42,318 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-09 07:52:42,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:42,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689689772] [2024-11-09 07:52:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689689772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:42,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:52:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125010902] [2024-11-09 07:52:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:42,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:42,320 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:42,733 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2024-11-09 07:52:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:52:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 07:52:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:42,736 INFO L225 Difference]: With dead ends: 229 [2024-11-09 07:52:42,736 INFO L226 Difference]: Without dead ends: 229 [2024-11-09 07:52:42,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:52:42,737 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 240 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:42,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 726 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:52:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-09 07:52:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-09 07:52:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 150 states have (on average 1.62) internal successors, (243), 212 states have internal predecessors, (243), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 264 transitions. [2024-11-09 07:52:42,747 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 264 transitions. Word has length 36 [2024-11-09 07:52:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 264 transitions. [2024-11-09 07:52:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 264 transitions. [2024-11-09 07:52:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:52:42,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:42,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:42,754 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-09 07:52:42,948 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-09 07:52:42,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1938732999, now seen corresponding path program 1 times [2024-11-09 07:52:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708405378] [2024-11-09 07:52:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:42,949 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-09 07:52:42,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:42,953 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-09 07:52:42,954 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-09 07:52:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:43,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:43,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:43,105 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-09 07:52:43,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:43,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708405378] [2024-11-09 07:52:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708405378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618874573] [2024-11-09 07:52:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:43,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:43,107 INFO L87 Difference]: Start difference. First operand 229 states and 264 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:43,123 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2024-11-09 07:52:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-09 07:52:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:43,125 INFO L225 Difference]: With dead ends: 233 [2024-11-09 07:52:43,125 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 07:52:43,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-09 07:52:43,126 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:43,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 07:52:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-09 07:52:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.603896103896104) internal successors, (247), 216 states have internal predecessors, (247), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2024-11-09 07:52:43,134 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 36 [2024-11-09 07:52:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:43,135 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2024-11-09 07:52:43,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2024-11-09 07:52:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:52:43,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:43,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:43,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:43,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:43,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash -407910745, now seen corresponding path program 1 times [2024-11-09 07:52:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829826176] [2024-11-09 07:52:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:43,342 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-09 07:52:43,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:43,345 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:52:43,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:52:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:43,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:43,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:43,507 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-09 07:52:43,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:43,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829826176] [2024-11-09 07:52:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829826176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280618625] [2024-11-09 07:52:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:43,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:43,511 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:43,531 INFO L93 Difference]: Finished difference Result 235 states and 270 transitions. [2024-11-09 07:52:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-09 07:52:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:43,532 INFO L225 Difference]: With dead ends: 235 [2024-11-09 07:52:43,532 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 07:52:43,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-09 07:52:43,533 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:43,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 07:52:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-09 07:52:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 156 states have (on average 1.5961538461538463) internal successors, (249), 218 states have internal predecessors, (249), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2024-11-09 07:52:43,544 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 40 [2024-11-09 07:52:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:43,545 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2024-11-09 07:52:43,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2024-11-09 07:52:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:52:43,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:43,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:43,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:43,746 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1160127762, now seen corresponding path program 1 times [2024-11-09 07:52:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:43,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499091164] [2024-11-09 07:52:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:43,747 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-09 07:52:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:43,748 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-09 07:52:43,749 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-09 07:52:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:43,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:52:43,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:43,972 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-09 07:52:44,070 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-09 07:52:44,071 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 16 treesize of output 17 [2024-11-09 07:52:44,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 07:52:44,259 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2024-11-09 07:52:44,259 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 2 case distinctions, treesize of input 25 treesize of output 34 [2024-11-09 07:52:44,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:44,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 07:52:44,694 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:52:44,745 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-09 07:52:44,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:44,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:44,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499091164] [2024-11-09 07:52:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499091164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:52:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328355469] [2024-11-09 07:52:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:44,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:52:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:52:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:52:44,747 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:46,389 INFO L93 Difference]: Finished difference Result 330 states and 364 transitions. [2024-11-09 07:52:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:52:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 07:52:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:46,391 INFO L225 Difference]: With dead ends: 330 [2024-11-09 07:52:46,391 INFO L226 Difference]: Without dead ends: 330 [2024-11-09 07:52:46,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:52:46,392 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 717 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:46,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 789 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:52:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-09 07:52:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 255. [2024-11-09 07:52:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 234 states have internal predecessors, (278), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-09 07:52:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2024-11-09 07:52:46,402 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 42 [2024-11-09 07:52:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:46,402 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2024-11-09 07:52:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:52:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2024-11-09 07:52:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:52:46,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:46,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:46,412 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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 07:52:46,607 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-09 07:52:46,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:46,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1160127761, now seen corresponding path program 1 times [2024-11-09 07:52:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:46,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826888770] [2024-11-09 07:52:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:46,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:46,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:46,610 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-09 07:52:46,610 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-09 07:52:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:46,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:52:46,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:46,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:52:46,942 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:52:46,943 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 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:52:47,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:47,159 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-09 07:52:47,267 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:52:47,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:52:47,451 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-09 07:52:47,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:47,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826888770] [2024-11-09 07:52:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826888770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:47,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:52:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935039836] [2024-11-09 07:52:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:52:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:52:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:52:47,454 INFO L87 Difference]: Start difference. First operand 255 states and 302 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:49,282 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2024-11-09 07:52:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:52:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2024-11-09 07:52:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:49,285 INFO L225 Difference]: With dead ends: 281 [2024-11-09 07:52:49,285 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 07:52:49,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:52:49,286 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 496 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:49,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 428 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:52:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 07:52:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 244. [2024-11-09 07:52:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 167 states have (on average 1.5688622754491017) internal successors, (262), 224 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2024-11-09 07:52:49,292 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 42 [2024-11-09 07:52:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:49,292 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2024-11-09 07:52:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:52:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2024-11-09 07:52:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:52:49,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:49,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:49,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 (18)] Ended with exit code 0 [2024-11-09 07:52:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:49,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:49,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1604202142, now seen corresponding path program 1 times [2024-11-09 07:52:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775546732] [2024-11-09 07:52:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:49,496 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-09 07:52:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:49,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:52:49,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 07:52:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:49,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:52:49,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:49,682 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-09 07:52:49,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:49,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775546732] [2024-11-09 07:52:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775546732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:52:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293590433] [2024-11-09 07:52:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:49,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:52:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:52:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:52:49,687 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:52:49,705 INFO L93 Difference]: Finished difference Result 246 states and 284 transitions. [2024-11-09 07:52:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:52:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-09 07:52:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:52:49,707 INFO L225 Difference]: With dead ends: 246 [2024-11-09 07:52:49,707 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 07:52:49,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-09 07:52:49,707 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:52:49,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:52:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 07:52:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-09 07:52:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.5562130177514792) internal successors, (263), 226 states have internal predecessors, (263), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:52:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2024-11-09 07:52:49,716 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 43 [2024-11-09 07:52:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:52:49,716 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2024-11-09 07:52:49,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:52:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2024-11-09 07:52:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:52:49,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:52:49,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:52:49,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 07:52:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:52:49,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:52:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:52:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 358651335, now seen corresponding path program 1 times [2024-11-09 07:52:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:52:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399851137] [2024-11-09 07:52:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:52:49,919 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-09 07:52:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:52:49,920 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-09 07:52:49,921 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-09 07:52:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:52:50,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:52:50,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:52:50,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:50,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:50,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:52:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:52:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:52:50,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-09 07:52:50,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2024-11-09 07:52:51,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 96 [2024-11-09 07:52:55,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:52:55,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 133 treesize of output 105 [2024-11-09 07:52:57,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:52:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 42 [2024-11-09 07:52:57,901 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-09 07:52:57,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:52:57,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:52:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399851137] [2024-11-09 07:52:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399851137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:52:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:52:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:52:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013292381] [2024-11-09 07:52:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:52:57,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:52:57,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:52:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:52:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=31, Unknown=5, NotChecked=0, Total=56 [2024-11-09 07:52:57,903 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:53:01,925 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 [0] [2024-11-09 07:53:05,936 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 [0] [2024-11-09 07:53:09,941 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 [0] [2024-11-09 07:53:11,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:13,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:14,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:18,292 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 [0] [2024-11-09 07:53:22,297 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 [0] [2024-11-09 07:53:23,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:25,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:29,794 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 [0] [2024-11-09 07:53:33,797 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 [0] [2024-11-09 07:53:37,800 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 [0] [2024-11-09 07:53:39,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:41,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:53:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:53:41,812 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2024-11-09 07:53:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:53:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 07:53:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:53:41,815 INFO L225 Difference]: With dead ends: 253 [2024-11-09 07:53:41,815 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 07:53:41,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=24, Invalid=43, Unknown=5, NotChecked=0, Total=72 [2024-11-09 07:53:41,816 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 63 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:53:41,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 661 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 15 Unknown, 0 Unchecked, 43.8s Time] [2024-11-09 07:53:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 07:53:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2024-11-09 07:53:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 169 states have (on average 1.544378698224852) internal successors, (261), 225 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 07:53:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 282 transitions. [2024-11-09 07:53:41,822 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 282 transitions. Word has length 44 [2024-11-09 07:53:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:53:41,822 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 282 transitions. [2024-11-09 07:53:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:53:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 282 transitions. [2024-11-09 07:53:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:53:41,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:53:41,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:53:41,834 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-09 07:53:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:53:42,024 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:53:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:53:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 235921110, now seen corresponding path program 1 times [2024-11-09 07:53:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:53:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975643702] [2024-11-09 07:53:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:53:42,025 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-09 07:53:42,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:53:42,026 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:53:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 07:53:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:53:42,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:53:42,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:53:42,247 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-09 07:53:42,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:53:42,453 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-09 07:53:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:53:42,525 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 07:53:42,525 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 19 treesize of output 11 [2024-11-09 07:53:42,788 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-09 07:53:42,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:53:43,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-09 07:53:43,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-11-09 07:53:43,625 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 07:53:43,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-09 07:53:43,692 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:53:43,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:53:43,827 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-09 07:53:43,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:53:43,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:53:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975643702] [2024-11-09 07:53:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975643702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:53:43,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:53:43,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 07:53:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470287061] [2024-11-09 07:53:43,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:53:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:53:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:53:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:53:43,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:53:43,829 INFO L87 Difference]: Start difference. First operand 245 states and 282 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:53:47,879 INFO L93 Difference]: Finished difference Result 386 states and 434 transitions. [2024-11-09 07:53:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:53:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-09 07:53:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:53:47,882 INFO L225 Difference]: With dead ends: 386 [2024-11-09 07:53:47,882 INFO L226 Difference]: Without dead ends: 386 [2024-11-09 07:53:47,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:53:47,883 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 645 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:53:47,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1490 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 07:53:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-09 07:53:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 308. [2024-11-09 07:53:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 284 states have internal predecessors, (351), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-09 07:53:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 380 transitions. [2024-11-09 07:53:47,895 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 380 transitions. Word has length 45 [2024-11-09 07:53:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:53:47,895 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 380 transitions. [2024-11-09 07:53:47,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 380 transitions. [2024-11-09 07:53:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:53:47,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:53:47,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:53:47,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-09 07:53:48,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:53:48,098 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-09 07:53:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:53:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash 235921111, now seen corresponding path program 1 times [2024-11-09 07:53:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:53:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47759647] [2024-11-09 07:53:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:53:48,099 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-09 07:53:48,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:53:48,100 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-09 07:53:48,101 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-09 07:53:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:53:48,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:53:48,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:53:48,366 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-09 07:53:48,436 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:53:48,437 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-09 07:53:48,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:53:48,780 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-09 07:53:48,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:53:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:53:48,864 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 07:53:48,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:53:48,949 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 19 treesize of output 11 [2024-11-09 07:53:48,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2024-11-09 07:53:49,252 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-09 07:53:49,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2024-11-09 07:53:49,294 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 07:53:49,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:53:49,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 07:53:49,576 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-09 07:53:49,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 07:53:49,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-09 07:53:50,520 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 33 treesize of output 17 [2024-11-09 07:53:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:53:50,832 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-09 07:53:50,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:53:50,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:53:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47759647] [2024-11-09 07:53:50,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47759647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:53:50,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:53:50,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-09 07:53:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388203563] [2024-11-09 07:53:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:53:50,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:53:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:53:50,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:53:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:53:50,835 INFO L87 Difference]: Start difference. First operand 308 states and 380 transitions. Second operand has 23 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:53:56,272 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 [0]