./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:23,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:23,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:28:23,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:23,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:23,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:23,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:23,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:23,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:23,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:23,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:23,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:23,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:23,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:23,958 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:23,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:23,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:23,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:23,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:23,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:23,960 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:23,962 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:23,962 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:23,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:23,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:23,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:23,963 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:23,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:23,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:23,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:23,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:23,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:23,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:23,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:23,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:23,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:23,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:28:23,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:28:23,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:23,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:23,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:23,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:23,968 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-11-12 13:28:24,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:24,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:24,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:24,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:24,235 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:24,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-12 13:28:25,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:25,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:25,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-12 13:28:25,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f11660e/7f948fe8e1bd444ba4e3e8563360e075/FLAG8495ecfa4 [2024-11-12 13:28:25,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f11660e/7f948fe8e1bd444ba4e3e8563360e075 [2024-11-12 13:28:25,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:25,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:25,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:25,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:25,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:25,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:25" (1/1) ... [2024-11-12 13:28:25,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207fc462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:25, skipping insertion in model container [2024-11-12 13:28:25,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:25" (1/1) ... [2024-11-12 13:28:25,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:26,334 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-12 13:28:26,392 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-12 13:28:26,402 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-12 13:28:26,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:26,425 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 13:28:26,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4cc4e3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:26, skipping insertion in model container [2024-11-12 13:28:26,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:26,426 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:28:26,428 INFO L158 Benchmark]: Toolchain (without parser) took 509.95ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 86.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:28:26,428 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:28:26,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.72ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 86.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:28:26,430 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.22ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.72ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 86.3MB 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_test17_2-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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:28,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:28,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 13:28:28,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:28,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:28,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:28,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:28,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:28,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:28,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:28,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:28,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:28,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:28,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:28,487 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:28,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:28,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:28,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:28,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:28,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:28,492 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:28,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:28,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:28,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:28,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:28,494 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:28:28,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:28,494 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:28:28,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:28,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:28,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:28,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:28,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:28,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:28,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:28,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:28,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:28,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:28,497 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:28:28,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:28,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:28,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:28,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:28,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:28,501 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-11-12 13:28:28,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:28,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:28,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:28,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:28,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:28,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-12 13:28:30,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:30,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:30,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-12 13:28:30,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529bcde7e/29581190bb4349e5998ac129a05f5c9e/FLAG2a95c795c [2024-11-12 13:28:31,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529bcde7e/29581190bb4349e5998ac129a05f5c9e [2024-11-12 13:28:31,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:31,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:31,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:31,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:31,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:31,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94577d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31, skipping insertion in model container [2024-11-12 13:28:31,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:31,440 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-12 13:28:31,502 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-12 13:28:31,511 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-12 13:28:31,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:31,537 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:28:31,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:31,572 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-12 13:28:31,586 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-12 13:28:31,592 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-12 13:28:31,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:31,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:28:31,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:31,707 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:28:31,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31 WrapperNode [2024-11-12 13:28:31,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:31,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:31,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:28:31,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:28:31,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,786 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 99 [2024-11-12 13:28:31,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:31,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:28:31,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:28:31,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:28:31,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,819 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-12 13:28:31,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:28:31,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:28:31,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:28:31,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:28:31,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (1/1) ... [2024-11-12 13:28:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:28:31,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:28:31,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:28:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-12 13:28:31,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-12 13:28:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:28:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:28:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:28:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:28:31,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:28:31,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:28:32,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:28:32,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:28:32,375 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-12 13:28:32,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:28:32,393 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:28:32,394 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:28:32,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:32 BoogieIcfgContainer [2024-11-12 13:28:32,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:28:32,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:28:32,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:28:32,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:28:32,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:28:31" (1/3) ... [2024-11-12 13:28:32,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a23948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:32, skipping insertion in model container [2024-11-12 13:28:32,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:31" (2/3) ... [2024-11-12 13:28:32,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a23948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:32, skipping insertion in model container [2024-11-12 13:28:32,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:32" (3/3) ... [2024-11-12 13:28:32,405 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2024-11-12 13:28:32,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:28:32,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-12 13:28:32,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:28:32,492 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;@369aa402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:28:32,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-12 13:28:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 63 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:32,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:32,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:32,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:32,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash 858994893, now seen corresponding path program 1 times [2024-11-12 13:28:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866753811] [2024-11-12 13:28:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:32,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:32,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 13:28:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:32,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 13:28:32,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:32,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:32,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866753811] [2024-11-12 13:28:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866753811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:32,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:28:32,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658589550] [2024-11-12 13:28:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:32,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:28:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:28:32,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:28:32,693 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 63 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12 13:28:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:32,708 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-12 13:28:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:28:32,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2024-11-12 13:28:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:32,715 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:28:32,715 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 13:28:32,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:28:32,719 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:32,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:28:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 13:28:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 13:28:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-11-12 13:28:32,749 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 14 [2024-11-12 13:28:32,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:32,750 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-11-12 13:28:32,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12 13:28:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-11-12 13:28:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:32,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:32,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:32,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 13:28:32,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:32,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:32,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 465967883, now seen corresponding path program 1 times [2024-11-12 13:28:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286902932] [2024-11-12 13:28:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:32,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:32,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 13:28:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:33,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:33,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:33,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:33,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286902932] [2024-11-12 13:28:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286902932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:28:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643872151] [2024-11-12 13:28:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:33,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:33,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:33,133 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:33,248 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2024-11-12 13:28:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-12 13:28:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:33,255 INFO L225 Difference]: With dead ends: 115 [2024-11-12 13:28:33,256 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:28:33,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:33,258 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 50 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:33,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 316 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:28:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2024-11-12 13:28:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-12 13:28:33,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2024-11-12 13:28:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:33,269 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-12 13:28:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-12 13:28:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:33,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:33,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:33,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 13:28:33,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:33,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 465866789, now seen corresponding path program 1 times [2024-11-12 13:28:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344036877] [2024-11-12 13:28:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:33,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:33,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:33,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:33,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 13:28:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:33,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:28:33,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:33,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-12 13:28:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:33,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:33,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344036877] [2024-11-12 13:28:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344036877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:28:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381845389] [2024-11-12 13:28:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:33,613 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:33,789 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2024-11-12 13:28:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-12 13:28:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:33,791 INFO L225 Difference]: With dead ends: 91 [2024-11-12 13:28:33,791 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 13:28:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12 13:28:33,792 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:28:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 13:28:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2024-11-12 13:28:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-12 13:28:33,806 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 14 [2024-11-12 13:28:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:33,806 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-12 13:28:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-12 13:28:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:33,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:33,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:33,812 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-12 13:28:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:34,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash 465866790, now seen corresponding path program 1 times [2024-11-12 13:28:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803796092] [2024-11-12 13:28:34,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:34,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:34,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 13:28:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:34,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 13:28:34,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:34,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:34,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:34,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803796092] [2024-11-12 13:28:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803796092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:28:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524583124] [2024-11-12 13:28:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:34,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:28:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:28:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:28:34,397 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-12 13:28:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:34,717 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2024-11-12 13:28:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:28:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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 14 [2024-11-12 13:28:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:34,723 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:28:34,724 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:28:34,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:28:34,725 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:34,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 357 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:28:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:28:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-11-12 13:28:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 77 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-12 13:28:34,732 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 14 [2024-11-12 13:28:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-12 13:28:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-12 13:28:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-12 13:28:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:34,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:34,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:34,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 13:28:34,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:34,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1353471564, now seen corresponding path program 1 times [2024-11-12 13:28:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866293959] [2024-11-12 13:28:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:34,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:34,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 13:28:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:34,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:34,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:35,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:35,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866293959] [2024-11-12 13:28:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866293959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:28:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20778736] [2024-11-12 13:28:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:35,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:35,006 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:35,103 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2024-11-12 13:28:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 13:28:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:35,110 INFO L225 Difference]: With dead ends: 136 [2024-11-12 13:28:35,111 INFO L226 Difference]: Without dead ends: 134 [2024-11-12 13:28:35,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:35,112 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:35,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 200 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-12 13:28:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 82. [2024-11-12 13:28:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 77 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-12 13:28:35,128 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 14 [2024-11-12 13:28:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:35,129 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-12 13:28:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-12 13:28:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:28:35,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:35,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:35,136 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-12 13:28:35,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:35,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1353370470, now seen corresponding path program 1 times [2024-11-12 13:28:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922768700] [2024-11-12 13:28:35,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:35,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:35,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 13:28:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:35,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:28:35,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:35,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:35,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922768700] [2024-11-12 13:28:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922768700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:28:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951818768] [2024-11-12 13:28:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:35,435 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:35,472 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-12 13:28:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-12 13:28:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:35,474 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:28:35,474 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 13:28:35,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12 13:28:35,476 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 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-12 13:28:35,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:28:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 13:28:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 13:28:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-12 13:28:35,484 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 14 [2024-11-12 13:28:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-12 13:28:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12 13:28:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-12 13:28:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:28:35,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:35,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:35,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:35,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:35,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:35,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1598186502, now seen corresponding path program 1 times [2024-11-12 13:28:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9846629] [2024-11-12 13:28:35,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:35,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:35,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 13:28:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:35,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 13:28:35,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:35,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:36,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:36,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:36,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9846629] [2024-11-12 13:28:36,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9846629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:36,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:36,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-11-12 13:28:36,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188341908] [2024-11-12 13:28:36,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:36,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:28:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:28:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:28:36,940 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:38,520 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-12 13:28:38,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:28:38,520 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-12 13:28:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:38,521 INFO L225 Difference]: With dead ends: 93 [2024-11-12 13:28:38,521 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 13:28:38,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:28:38,522 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 166 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:38,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 571 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:28:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 13:28:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-12 13:28:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 81 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-12 13:28:38,528 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 17 [2024-11-12 13:28:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:38,528 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-12 13:28:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-12 13:28:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:28:38,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:38,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:38,534 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-12 13:28:38,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:38,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:38,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 740047555, now seen corresponding path program 1 times [2024-11-12 13:28:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:38,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508442450] [2024-11-12 13:28:38,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:38,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:38,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 13:28:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:38,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:28:38,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:38,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:38,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:38,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508442450] [2024-11-12 13:28:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508442450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:28:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003055590] [2024-11-12 13:28:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:38,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:28:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:28:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:28:38,847 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 13:28:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:38,992 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-11-12 13:28:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:28:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2024-11-12 13:28:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:38,994 INFO L225 Difference]: With dead ends: 95 [2024-11-12 13:28:38,994 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 13:28:38,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:28:38,995 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:38,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 212 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 13:28:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-11-12 13:28:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-12 13:28:39,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 22 [2024-11-12 13:28:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:39,000 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-12 13:28:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 13:28:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-12 13:28:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:28:39,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:39,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:39,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 13:28:39,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:39,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:39,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash 740047556, now seen corresponding path program 1 times [2024-11-12 13:28:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:39,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947406676] [2024-11-12 13:28:39,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:39,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:39,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 13:28:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:39,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:28:39,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:39,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:39,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:40,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947406676] [2024-11-12 13:28:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947406676] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:28:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-11-12 13:28:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323265329] [2024-11-12 13:28:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:40,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:28:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:28:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:28:40,277 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-12 13:28:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:41,068 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2024-11-12 13:28:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:28:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-12 13:28:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:41,071 INFO L225 Difference]: With dead ends: 139 [2024-11-12 13:28:41,071 INFO L226 Difference]: Without dead ends: 139 [2024-11-12 13:28:41,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:28:41,072 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 117 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:41,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 257 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:28:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-12 13:28:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2024-11-12 13:28:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.507936507936508) internal successors, (95), 82 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-12 13:28:41,086 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 22 [2024-11-12 13:28:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:41,086 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-12 13:28:41,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-12 13:28:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-12 13:28:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:28:41,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:41,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:41,102 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-12 13:28:41,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:41,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:41,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1466636327, now seen corresponding path program 1 times [2024-11-12 13:28:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281913119] [2024-11-12 13:28:41,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:41,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:41,290 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:41,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 13:28:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:41,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:41,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:41,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:41,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281913119] [2024-11-12 13:28:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281913119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:41,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:28:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143871185] [2024-11-12 13:28:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:41,385 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 13:28:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:41,422 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-11-12 13:28:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2024-11-12 13:28:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:41,424 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:28:41,424 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:28:41,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-12 13:28:41,425 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:41,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 200 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:28:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:28:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:28:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-12 13:28:41,435 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 23 [2024-11-12 13:28:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:41,435 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-12 13:28:41,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-12 13:28:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-12 13:28:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:28:41,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:41,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:41,440 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-12 13:28:41,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:41,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:41,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1466637803, now seen corresponding path program 1 times [2024-11-12 13:28:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63127863] [2024-11-12 13:28:41,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:41,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:41,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:41,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 13:28:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 13:28:41,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:41,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:28:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:41,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:41,802 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 14 treesize of output 12 [2024-11-12 13:28:41,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-12 13:28:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:41,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63127863] [2024-11-12 13:28:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63127863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:41,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-12 13:28:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219304118] [2024-11-12 13:28:41,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:41,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:28:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:28:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:28:41,835 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-12 13:28:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:42,034 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-11-12 13:28:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:28:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 23 [2024-11-12 13:28:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:42,036 INFO L225 Difference]: With dead ends: 129 [2024-11-12 13:28:42,036 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 13:28:42,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:28:42,036 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:42,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 364 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:28:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 13:28:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2024-11-12 13:28:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 96 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:28:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-12 13:28:42,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 23 [2024-11-12 13:28:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-12 13:28:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-12 13:28:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-12 13:28:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:28:42,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:42,045 INFO L218 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] [2024-11-12 13:28:42,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 13:28:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:42,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1778913965, now seen corresponding path program 1 times [2024-11-12 13:28:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481289666] [2024-11-12 13:28:42,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:42,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:42,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:42,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:42,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 13:28:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:42,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:28:42,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:42,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:42,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481289666] [2024-11-12 13:28:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481289666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:42,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:28:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785634417] [2024-11-12 13:28:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:42,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:28:42,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:28:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:28:42,420 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-12 13:28:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:42,502 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2024-11-12 13:28:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:28:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 24 [2024-11-12 13:28:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:42,504 INFO L225 Difference]: With dead ends: 100 [2024-11-12 13:28:42,504 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 13:28:42,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:28:42,505 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:42,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 159 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 13:28:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 13:28:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 95 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:28:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2024-11-12 13:28:42,508 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 24 [2024-11-12 13:28:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:42,509 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2024-11-12 13:28:42,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-12 13:28:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2024-11-12 13:28:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:28:42,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:42,510 INFO L218 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] [2024-11-12 13:28:42,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:42,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1778868221, now seen corresponding path program 1 times [2024-11-12 13:28:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690048004] [2024-11-12 13:28:42,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:42,715 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:42,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 13:28:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:28:42,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:42,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:28:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:42,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:42,970 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 14 treesize of output 12 [2024-11-12 13:28:42,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-12 13:28:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:43,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690048004] [2024-11-12 13:28:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690048004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:43,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-12 13:28:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697024601] [2024-11-12 13:28:43,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:28:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:28:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:28:43,014 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:28:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:43,361 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2024-11-12 13:28:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:28:43,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 13:28:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:43,363 INFO L225 Difference]: With dead ends: 126 [2024-11-12 13:28:43,363 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 13:28:43,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:28:43,364 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 149 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:43,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:28:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 13:28:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2024-11-12 13:28:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.5) internal successors, (120), 97 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:28:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2024-11-12 13:28:43,367 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 24 [2024-11-12 13:28:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:43,367 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2024-11-12 13:28:43,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:28:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2024-11-12 13:28:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:28:43,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:43,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:43,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:43,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:43,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -878858933, now seen corresponding path program 1 times [2024-11-12 13:28:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453181134] [2024-11-12 13:28:43,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:43,573 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:43,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 13:28:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:43,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 13:28:43,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:43,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:43,696 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-12 13:28:43,718 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:28:43,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-12 13:28:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-12 13:28:43,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:28:43,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:43,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453181134] [2024-11-12 13:28:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453181134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:43,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:43,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-12 13:28:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119109260] [2024-11-12 13:28:43,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:28:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:43,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:28:43,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-12 13:28:43,887 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:44,131 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2024-11-12 13:28:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:28:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-12 13:28:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:44,132 INFO L225 Difference]: With dead ends: 137 [2024-11-12 13:28:44,132 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 13:28:44,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-12 13:28:44,133 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:44,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 267 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2024-11-12 13:28:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 13:28:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2024-11-12 13:28:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 103 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:28:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-11-12 13:28:44,149 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 26 [2024-11-12 13:28:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:44,149 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-12 13:28:44,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-11-12 13:28:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:28:44,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:44,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:44,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 13:28:44,352 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-12 13:28:44,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:44,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -878858932, now seen corresponding path program 1 times [2024-11-12 13:28:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471224520] [2024-11-12 13:28:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:44,354 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-12 13:28:44,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 13:28:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:44,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:28:44,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:44,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:44,813 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-12 13:28:44,843 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:28:44,843 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 16 [2024-11-12 13:28:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:28:44,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:45,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471224520] [2024-11-12 13:28:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471224520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1832910044] [2024-11-12 13:28:45,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:28:45,101 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:28:45,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-12 13:28:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:45,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:28:45,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:45,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:45,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:45,738 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-12 13:28:45,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:45,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:28:45,774 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:28:45,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:28:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:28:45,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:54,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1832910044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:54,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:54,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2024-11-12 13:28:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013873778] [2024-11-12 13:28:54,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:28:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:54,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:28:54,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=562, Unknown=4, NotChecked=98, Total=756 [2024-11-12 13:28:54,355 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:28:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:55,846 INFO L93 Difference]: Finished difference Result 287 states and 373 transitions. [2024-11-12 13:28:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:28:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-12 13:28:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:55,849 INFO L225 Difference]: With dead ends: 287 [2024-11-12 13:28:55,849 INFO L226 Difference]: Without dead ends: 287 [2024-11-12 13:28:55,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=157, Invalid=902, Unknown=5, NotChecked=126, Total=1190 [2024-11-12 13:28:55,850 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 321 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:55,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 693 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 762 Invalid, 0 Unknown, 454 Unchecked, 1.1s Time] [2024-11-12 13:28:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-12 13:28:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 114. [2024-11-12 13:28:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 108 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:28:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2024-11-12 13:28:55,855 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 26 [2024-11-12 13:28:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:55,855 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2024-11-12 13:28:55,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:28:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2024-11-12 13:28:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:28:55,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:55,857 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:55,861 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-12 13:28:56,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:56,257 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:56,257 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:28:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 245332006, now seen corresponding path program 2 times [2024-11-12 13:28:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649808936] [2024-11-12 13:28:56,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:28:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:28:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:56,262 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:28:56,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-12 13:28:56,338 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:28:56,338 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:28:56,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:28:56,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:28:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:56,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:58,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649808936] [2024-11-12 13:28:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649808936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:58,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2024-11-12 13:28:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283908839] [2024-11-12 13:28:58,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:58,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:28:58,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:28:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:28:58,438 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:02,520 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2024-11-12 13:29:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 13:29:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-12 13:29:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:02,522 INFO L225 Difference]: With dead ends: 137 [2024-11-12 13:29:02,522 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 13:29:02,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 13:29:02,523 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 183 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:02,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 540 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 13:29:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 13:29:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-12 13:29:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 126 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2024-11-12 13:29:02,527 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 26 [2024-11-12 13:29:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2024-11-12 13:29:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2024-11-12 13:29:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:29:02,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:02,529 INFO L218 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-12 13:29:02,534 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-12 13:29:02,732 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-12 13:29:02,733 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash -24310932, now seen corresponding path program 1 times [2024-11-12 13:29:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223199320] [2024-11-12 13:29:02,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:02,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:02,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:02,735 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-12 13:29:02,736 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-12 13:29:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:02,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:29:02,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:02,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:02,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223199320] [2024-11-12 13:29:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223199320] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:02,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-12 13:29:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303933957] [2024-11-12 13:29:02,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:29:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:29:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:29:02,984 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,239 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2024-11-12 13:29:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:29:03,240 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-12 13:29:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,241 INFO L225 Difference]: With dead ends: 169 [2024-11-12 13:29:03,241 INFO L226 Difference]: Without dead ends: 169 [2024-11-12 13:29:03,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:03,242 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 180 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 404 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-12 13:29:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2024-11-12 13:29:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 122 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2024-11-12 13:29:03,246 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 27 [2024-11-12 13:29:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,246 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2024-11-12 13:29:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2024-11-12 13:29:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:29:03,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,251 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-12 13:29:03,448 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-12 13:29:03,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1525074233, now seen corresponding path program 1 times [2024-11-12 13:29:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452873289] [2024-11-12 13:29:03,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:03,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:03,453 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-12 13:29:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:03,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:29:03,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:03,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:03,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452873289] [2024-11-12 13:29:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452873289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:03,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:03,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:03,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583657833] [2024-11-12 13:29:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:03,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:03,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:03,538 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,568 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-12 13:29:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-12 13:29:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,570 INFO L225 Difference]: With dead ends: 137 [2024-11-12 13:29:03,570 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 13:29:03,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12 13:29:03,570 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:03,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 13:29:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-12 13:29:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 124 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2024-11-12 13:29:03,578 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 28 [2024-11-12 13:29:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2024-11-12 13:29:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2024-11-12 13:29:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:29:03,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:03,780 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-12 13:29:03,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1027082728, now seen corresponding path program 1 times [2024-11-12 13:29:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380251239] [2024-11-12 13:29:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:03,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:03,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:03,783 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-12 13:29:03,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-12 13:29:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:03,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:29:03,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:29:03,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:03,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380251239] [2024-11-12 13:29:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380251239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:03,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:03,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:29:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774955031] [2024-11-12 13:29:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:03,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:29:03,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:29:03,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:29:03,859 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,908 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2024-11-12 13:29:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:29:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-12 13:29:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,909 INFO L225 Difference]: With dead ends: 126 [2024-11-12 13:29:03,909 INFO L226 Difference]: Without dead ends: 126 [2024-11-12 13:29:03,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:29:03,910 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-12 13:29:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-12 13:29:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 114 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-12 13:29:03,913 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 28 [2024-11-12 13:29:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,913 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-12 13:29:03,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-12 13:29:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:29:03,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,918 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-12 13:29:04,114 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-12 13:29:04,115 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:04,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1822208300, now seen corresponding path program 2 times [2024-11-12 13:29:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957569113] [2024-11-12 13:29:04,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:04,118 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:04,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-12 13:29:04,206 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:04,206 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:04,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:29:04,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:04,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:04,836 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-12 13:29:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:04,858 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 21 treesize of output 14 [2024-11-12 13:29:04,874 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:04,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:29:04,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:09,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957569113] [2024-11-12 13:29:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957569113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [890550851] [2024-11-12 13:29:09,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:09,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:09,254 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:09,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-12 13:29:09,368 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:09,368 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:09,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:29:09,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:09,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:09,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:09,641 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 21 treesize of output 14 [2024-11-12 13:29:09,662 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:09,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:29:09,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [890550851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:09,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2024-11-12 13:29:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638527349] [2024-11-12 13:29:09,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:09,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:29:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:29:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=285, Unknown=2, NotChecked=34, Total=380 [2024-11-12 13:29:09,894 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:11,161 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2024-11-12 13:29:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:29:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-12 13:29:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:11,163 INFO L225 Difference]: With dead ends: 195 [2024-11-12 13:29:11,163 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 13:29:11,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=100, Invalid=502, Unknown=2, NotChecked=46, Total=650 [2024-11-12 13:29:11,164 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 120 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:11,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 845 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 783 Invalid, 0 Unknown, 156 Unchecked, 1.0s Time] [2024-11-12 13:29:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 13:29:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2024-11-12 13:29:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 114 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-12 13:29:11,168 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 29 [2024-11-12 13:29:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:11,168 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-12 13:29:11,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-12 13:29:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:29:11,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:11,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:11,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-12 13:29:11,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:11,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash -475836742, now seen corresponding path program 1 times [2024-11-12 13:29:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770419559] [2024-11-12 13:29:11,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:11,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:11,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:11,574 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-12 13:29:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:11,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:29:11,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:11,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:29:11,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:29:11,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:11,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770419559] [2024-11-12 13:29:11,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770419559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:11,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-11-12 13:29:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725514840] [2024-11-12 13:29:11,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:11,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:29:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:29:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:29:11,842 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:12,076 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-12 13:29:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:29:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-12 13:29:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:12,077 INFO L225 Difference]: With dead ends: 138 [2024-11-12 13:29:12,077 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 13:29:12,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:12,078 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:12,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 267 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 13:29:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-11-12 13:29:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 115 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-12 13:29:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-11-12 13:29:12,082 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 31 [2024-11-12 13:29:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:12,082 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-11-12 13:29:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-11-12 13:29:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:29:12,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:12,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:12,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-12 13:29:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -475836741, now seen corresponding path program 1 times [2024-11-12 13:29:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183752832] [2024-11-12 13:29:12,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:12,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:12,285 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:12,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-12 13:29:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:12,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 13:29:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:12,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:13,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183752832] [2024-11-12 13:29:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183752832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:13,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-11-12 13:29:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792982065] [2024-11-12 13:29:13,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:29:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:29:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:29:13,298 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:14,600 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2024-11-12 13:29:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:29:14,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-11-12 13:29:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:14,602 INFO L225 Difference]: With dead ends: 223 [2024-11-12 13:29:14,603 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 13:29:14,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:29:14,603 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 308 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:14,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 573 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:29:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 13:29:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 148. [2024-11-12 13:29:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 139 states have internal predecessors, (176), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2024-11-12 13:29:14,608 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 31 [2024-11-12 13:29:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:14,609 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2024-11-12 13:29:14,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2024-11-12 13:29:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:29:14,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:14,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:14,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:14,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:14,811 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash 818465469, now seen corresponding path program 1 times [2024-11-12 13:29:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:14,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254445549] [2024-11-12 13:29:14,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:14,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:14,813 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-12 13:29:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:14,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 13:29:14,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:14,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:15,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:29:15,093 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 25 treesize of output 29 [2024-11-12 13:29:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:15,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:15,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254445549] [2024-11-12 13:29:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254445549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:15,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-12 13:29:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259943486] [2024-11-12 13:29:15,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:15,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:29:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:15,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:29:15,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:29:15,376 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:29:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:15,814 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2024-11-12 13:29:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:29:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-12 13:29:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:15,815 INFO L225 Difference]: With dead ends: 204 [2024-11-12 13:29:15,815 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 13:29:15,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:29:15,816 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 184 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:15,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 339 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:29:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 13:29:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2024-11-12 13:29:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 153 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-12 13:29:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2024-11-12 13:29:15,821 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 32 [2024-11-12 13:29:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:15,822 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2024-11-12 13:29:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:29:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2024-11-12 13:29:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:29:15,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:15,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:15,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-12 13:29:16,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:16,027 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:16,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1191141044, now seen corresponding path program 3 times [2024-11-12 13:29:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738592342] [2024-11-12 13:29:16,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:29:16,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:16,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:16,029 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:16,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-12 13:29:16,089 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 13:29:16,089 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:16,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:29:16,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:16,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:16,500 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-12 13:29:16,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:16,516 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 16 treesize of output 11 [2024-11-12 13:29:16,523 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:16,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2024-11-12 13:29:16,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:16,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738592342] [2024-11-12 13:29:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738592342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1560595082] [2024-11-12 13:29:16,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:29:16,828 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:16,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:16,829 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:16,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-12 13:29:16,935 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 13:29:16,935 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:16,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:29:16,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:16,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:17,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:17,211 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 16 treesize of output 11 [2024-11-12 13:29:17,228 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:17,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2024-11-12 13:29:17,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1560595082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:17,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:17,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-12 13:29:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653353343] [2024-11-12 13:29:17,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:17,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:29:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:17,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:29:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2024-11-12 13:29:17,414 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:18,384 INFO L93 Difference]: Finished difference Result 186 states and 237 transitions. [2024-11-12 13:29:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:29:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-12 13:29:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:18,386 INFO L225 Difference]: With dead ends: 186 [2024-11-12 13:29:18,386 INFO L226 Difference]: Without dead ends: 186 [2024-11-12 13:29:18,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2024-11-12 13:29:18,388 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 484 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 117 Unchecked, 0.6s Time] [2024-11-12 13:29:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-12 13:29:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-12 13:29:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.406015037593985) internal successors, (187), 146 states have internal predecessors, (187), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-12 13:29:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2024-11-12 13:29:18,396 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 32 [2024-11-12 13:29:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:18,397 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2024-11-12 13:29:18,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2024-11-12 13:29:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:29:18,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:18,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:18,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-12 13:29:18,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:18,799 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash -397374190, now seen corresponding path program 1 times [2024-11-12 13:29:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445260916] [2024-11-12 13:29:18,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:18,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:18,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:18,801 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:18,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-12 13:29:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:18,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:29:18,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:18,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:29:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:18,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-12 13:29:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:19,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445260916] [2024-11-12 13:29:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445260916] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:19,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-12 13:29:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543354098] [2024-11-12 13:29:19,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:29:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:29:19,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:29:19,155 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:19,655 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2024-11-12 13:29:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:29:19,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2024-11-12 13:29:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:19,657 INFO L225 Difference]: With dead ends: 222 [2024-11-12 13:29:19,657 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 13:29:19,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:19,658 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 51 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:19,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 489 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:29:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 13:29:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2024-11-12 13:29:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.4619883040935673) internal successors, (250), 183 states have internal predecessors, (250), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-12 13:29:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2024-11-12 13:29:19,663 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 33 [2024-11-12 13:29:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:19,663 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2024-11-12 13:29:19,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2024-11-12 13:29:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 13:29:19,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:19,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:19,668 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 (29)] Ended with exit code 0 [2024-11-12 13:29:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:19,865 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 566302140, now seen corresponding path program 1 times [2024-11-12 13:29:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050420900] [2024-11-12 13:29:19,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:19,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:19,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:19,867 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:19,867 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 (30)] Waiting until timeout for monitored process [2024-11-12 13:29:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:19,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:29:19,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:20,260 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-12 13:29:20,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:29:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:29:20,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:20,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-12 13:29:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:20,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050420900] [2024-11-12 13:29:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050420900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:20,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2024-11-12 13:29:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121776670] [2024-11-12 13:29:20,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:29:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:29:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:29:20,730 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:21,696 INFO L93 Difference]: Finished difference Result 225 states and 293 transitions. [2024-11-12 13:29:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:29:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2024-11-12 13:29:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:21,698 INFO L225 Difference]: With dead ends: 225 [2024-11-12 13:29:21,698 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 13:29:21,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:29:21,699 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 211 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:21,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 452 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:29:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 13:29:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2024-11-12 13:29:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.4540229885057472) internal successors, (253), 185 states have internal predecessors, (253), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-12 13:29:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 270 transitions. [2024-11-12 13:29:21,704 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 270 transitions. Word has length 34 [2024-11-12 13:29:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:21,704 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 270 transitions. [2024-11-12 13:29:21,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 270 transitions. [2024-11-12 13:29:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:29:21,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:21,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:21,710 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 (30)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:21,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:21,906 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:21,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 375497300, now seen corresponding path program 1 times [2024-11-12 13:29:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:21,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621901692] [2024-11-12 13:29:21,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:21,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:21,908 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:21,909 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 (31)] Waiting until timeout for monitored process [2024-11-12 13:29:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:21,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:29:21,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:22,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:22,072 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-12 13:29:22,106 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-12 13:29:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:22,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:22,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-12 13:29:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:22,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621901692] [2024-11-12 13:29:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621901692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:22,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-12 13:29:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649314996] [2024-11-12 13:29:22,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:29:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:29:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:29:22,360 INFO L87 Difference]: Start difference. First operand 197 states and 270 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:22,835 INFO L93 Difference]: Finished difference Result 206 states and 280 transitions. [2024-11-12 13:29:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:29:22,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-12 13:29:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:22,837 INFO L225 Difference]: With dead ends: 206 [2024-11-12 13:29:22,837 INFO L226 Difference]: Without dead ends: 206 [2024-11-12 13:29:22,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:22,838 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:22,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 397 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:29:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-12 13:29:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2024-11-12 13:29:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.4514285714285715) internal successors, (254), 186 states have internal predecessors, (254), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-12 13:29:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2024-11-12 13:29:22,842 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 35 [2024-11-12 13:29:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:22,843 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2024-11-12 13:29:22,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2024-11-12 13:29:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:29:22,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:22,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:22,848 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 (31)] Ended with exit code 0 [2024-11-12 13:29:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:23,044 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2027972411, now seen corresponding path program 1 times [2024-11-12 13:29:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230085968] [2024-11-12 13:29:23,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:23,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:23,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:23,047 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:23,048 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 (32)] Waiting until timeout for monitored process [2024-11-12 13:29:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:23,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:29:23,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:23,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:29:23,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:23,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230085968] [2024-11-12 13:29:23,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230085968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:23,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-12 13:29:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798587265] [2024-11-12 13:29:23,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:23,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:29:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:29:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:23,425 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:23,625 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2024-11-12 13:29:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:29:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-11-12 13:29:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:23,629 INFO L225 Difference]: With dead ends: 218 [2024-11-12 13:29:23,629 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 13:29:23,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:29:23,629 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 85 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:23,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 406 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 13:29:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2024-11-12 13:29:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 187 states have (on average 1.427807486631016) internal successors, (267), 197 states have internal predecessors, (267), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-12 13:29:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 287 transitions. [2024-11-12 13:29:23,634 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 287 transitions. Word has length 36 [2024-11-12 13:29:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:23,634 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 287 transitions. [2024-11-12 13:29:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 287 transitions. [2024-11-12 13:29:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:29:23,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:23,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:23,640 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 (32)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:23,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:23,836 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:23,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1883049109, now seen corresponding path program 1 times [2024-11-12 13:29:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67110839] [2024-11-12 13:29:23,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:23,838 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:23,839 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 (33)] Waiting until timeout for monitored process [2024-11-12 13:29:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:23,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:29:23,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:29:23,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:23,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67110839] [2024-11-12 13:29:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67110839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683198467] [2024-11-12 13:29:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:23,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:23,967 INFO L87 Difference]: Start difference. First operand 211 states and 287 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:23,993 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2024-11-12 13:29:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-12 13:29:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:23,994 INFO L225 Difference]: With dead ends: 164 [2024-11-12 13:29:23,994 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 13:29:23,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-12 13:29:23,995 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:23,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 13:29:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-12 13:29:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 151 states have internal predecessors, (190), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2024-11-12 13:29:23,999 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 35 [2024-11-12 13:29:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:23,999 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2024-11-12 13:29:23,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2024-11-12 13:29:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:29:24,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:24,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:24,004 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 (33)] Ended with exit code 0 [2024-11-12 13:29:24,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:24,201 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:24,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -185148971, now seen corresponding path program 1 times [2024-11-12 13:29:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620169916] [2024-11-12 13:29:24,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:24,203 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:24,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-12 13:29:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:24,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:29:24,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:24,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:24,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:24,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620169916] [2024-11-12 13:29:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620169916] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:24,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-12 13:29:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219756925] [2024-11-12 13:29:24,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:29:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:29:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:29:24,523 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:24,648 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2024-11-12 13:29:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:29:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2024-11-12 13:29:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:24,649 INFO L225 Difference]: With dead ends: 172 [2024-11-12 13:29:24,649 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 13:29:24,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:29:24,650 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 120 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:24,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 355 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 13:29:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2024-11-12 13:29:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 148 states have internal predecessors, (182), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2024-11-12 13:29:24,654 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 36 [2024-11-12 13:29:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:24,654 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2024-11-12 13:29:24,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2024-11-12 13:29:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:29:24,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:24,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:24,659 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 (34)] Ended with exit code 0 [2024-11-12 13:29:24,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:24,856 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:24,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2145816479, now seen corresponding path program 1 times [2024-11-12 13:29:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865623519] [2024-11-12 13:29:24,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:24,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:24,858 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:24,859 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 (35)] Waiting until timeout for monitored process [2024-11-12 13:29:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:24,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:29:24,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:25,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:25,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865623519] [2024-11-12 13:29:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865623519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:25,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-12 13:29:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383371857] [2024-11-12 13:29:25,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:25,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:29:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:29:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:25,305 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:25,482 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2024-11-12 13:29:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:29:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2024-11-12 13:29:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:25,484 INFO L225 Difference]: With dead ends: 173 [2024-11-12 13:29:25,484 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 13:29:25,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:29:25,484 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:25,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 444 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 13:29:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-12 13:29:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 161 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2024-11-12 13:29:25,487 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 37 [2024-11-12 13:29:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:25,488 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2024-11-12 13:29:25,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2024-11-12 13:29:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 13:29:25,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:25,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:25,492 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 (35)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:25,689 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 731071653, now seen corresponding path program 2 times [2024-11-12 13:29:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442160671] [2024-11-12 13:29:25,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:25,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:25,691 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:25,692 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 (36)] Waiting until timeout for monitored process [2024-11-12 13:29:25,796 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:25,796 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:25,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 13:29:25,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:25,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:25,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:26,305 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-12 13:29:26,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:26,322 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 21 treesize of output 14 [2024-11-12 13:29:26,333 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:26,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:26,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:26,639 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 21 treesize of output 14 [2024-11-12 13:29:26,663 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:26,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:30,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442160671] [2024-11-12 13:29:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442160671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [865450923] [2024-11-12 13:29:30,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:30,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:30,990 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:30,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-12 13:29:31,147 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:31,147 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:31,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 13:29:31,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:31,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:31,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:31,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:31,522 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 21 treesize of output 14 [2024-11-12 13:29:31,533 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:31,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:31,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:31,695 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 21 treesize of output 14 [2024-11-12 13:29:31,704 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:31,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:31,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:35,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul |c_ULTIMATE.start_alloc_17_~i~0#1| (_ bv4 32)))) (let ((.cse0 (bvadd (_ bv4 32) .cse1 |c_ULTIMATE.start_alloc_17_~array#1.offset|))) (and (forall ((|v_ldv_malloc_#res.base_128| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_128|))) (forall ((v_ArrVal_475 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_128| v_ArrVal_475) |c_ULTIMATE.start_alloc_17_~array#1.base|))))) (or (forall ((|v_ldv_malloc_#res.base_128| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_128|)))) (bvule (bvadd .cse1 |c_ULTIMATE.start_alloc_17_~array#1.offset|) .cse0))))) is different from false [2024-11-12 13:29:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [865450923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:35,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2024-11-12 13:29:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284866094] [2024-11-12 13:29:35,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:29:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:29:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=356, Unknown=3, NotChecked=78, Total=506 [2024-11-12 13:29:35,876 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:36,974 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2024-11-12 13:29:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:29:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-11-12 13:29:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:36,975 INFO L225 Difference]: With dead ends: 202 [2024-11-12 13:29:36,975 INFO L226 Difference]: Without dead ends: 202 [2024-11-12 13:29:36,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=125, Invalid=692, Unknown=3, NotChecked=110, Total=930 [2024-11-12 13:29:36,976 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 127 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:36,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 619 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 658 Invalid, 0 Unknown, 120 Unchecked, 0.8s Time] [2024-11-12 13:29:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-12 13:29:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2024-11-12 13:29:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.2857142857142858) internal successors, (207), 171 states have internal predecessors, (207), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-12 13:29:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2024-11-12 13:29:36,980 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 39 [2024-11-12 13:29:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2024-11-12 13:29:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2024-11-12 13:29:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:29:36,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:36,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:36,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:37,186 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 (36)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:37,383 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash -275846323, now seen corresponding path program 1 times [2024-11-12 13:29:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568840992] [2024-11-12 13:29:37,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:37,387 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:37,388 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 (38)] Waiting until timeout for monitored process [2024-11-12 13:29:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:37,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:29:37,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:37,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:37,573 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 11 treesize of output 7 [2024-11-12 13:29:37,617 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 7 treesize of output 5 [2024-11-12 13:29:37,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:29:37,825 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 16 treesize of output 13 [2024-11-12 13:29:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:37,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:37,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:37,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568840992] [2024-11-12 13:29:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568840992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:37,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [78394199] [2024-11-12 13:29:37,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:37,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:38,006 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:38,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-12 13:29:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:38,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 13:29:38,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:38,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:38,304 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 11 treesize of output 7 [2024-11-12 13:29:38,369 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 7 treesize of output 5 [2024-11-12 13:29:38,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:29:38,593 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 16 treesize of output 13 [2024-11-12 13:29:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:38,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:38,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [78394199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:38,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:38,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-12 13:29:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528254860] [2024-11-12 13:29:38,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:38,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:29:38,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:29:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:29:38,693 INFO L87 Difference]: Start difference. First operand 185 states and 227 transitions. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:29:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:39,261 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2024-11-12 13:29:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:29:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-11-12 13:29:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:39,262 INFO L225 Difference]: With dead ends: 218 [2024-11-12 13:29:39,262 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 13:29:39,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:29:39,263 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:39,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 479 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:29:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 13:29:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2024-11-12 13:29:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 194 states have internal predecessors, (232), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-12 13:29:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2024-11-12 13:29:39,267 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 40 [2024-11-12 13:29:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:39,267 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2024-11-12 13:29:39,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:29:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2024-11-12 13:29:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:29:39,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:39,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:39,272 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 (38)] Ended with exit code 0 [2024-11-12 13:29:39,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:39,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:39,672 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -72017103, now seen corresponding path program 1 times [2024-11-12 13:29:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:39,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905336046] [2024-11-12 13:29:39,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:39,674 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:39,675 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 (40)] Waiting until timeout for monitored process [2024-11-12 13:29:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:39,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:29:39,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:29:39,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:40,266 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-12 13:29:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:29:40,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905336046] [2024-11-12 13:29:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905336046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:40,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-12 13:29:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102538450] [2024-11-12 13:29:40,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:40,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:29:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:29:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:29:40,454 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:41,262 INFO L93 Difference]: Finished difference Result 214 states and 255 transitions. [2024-11-12 13:29:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:29:41,262 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2024-11-12 13:29:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:41,263 INFO L225 Difference]: With dead ends: 214 [2024-11-12 13:29:41,263 INFO L226 Difference]: Without dead ends: 214 [2024-11-12 13:29:41,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:29:41,264 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 156 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:41,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 614 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:29:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-12 13:29:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 206. [2024-11-12 13:29:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 191 states have internal predecessors, (226), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-12 13:29:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2024-11-12 13:29:41,268 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 41 [2024-11-12 13:29:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:41,268 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2024-11-12 13:29:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2024-11-12 13:29:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:29:41,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:41,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:41,275 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 (40)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:41,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:41,470 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-12 13:29:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1776836543, now seen corresponding path program 2 times [2024-11-12 13:29:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294407049] [2024-11-12 13:29:41,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:41,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:41,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:41,474 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:41,475 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 (41)] Waiting until timeout for monitored process [2024-11-12 13:29:41,573 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:41,574 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:29:41,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:41,608 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 11 treesize of output 7 [2024-11-12 13:29:41,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 13:29:41,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:29:41,885 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 16 treesize of output 13 [2024-11-12 13:29:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:41,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:45,992 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 46 treesize of output 42 [2024-11-12 13:29:54,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-12 13:29:54,184 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 68 treesize of output 66 [2024-11-12 13:29:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:54,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294407049] [2024-11-12 13:29:54,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294407049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:54,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2024-11-12 13:29:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678567122] [2024-11-12 13:29:54,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:29:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:29:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=312, Unknown=3, NotChecked=0, Total=380 [2024-11-12 13:29:54,232 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)