./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:05:46,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:05:46,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:05:46,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:05:46,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:05:46,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:05:46,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:05:46,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:05:46,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:05:46,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:05:46,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:05:46,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:05:46,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:05:46,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:05:46,736 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:05:46,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:05:46,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:05:46,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:05:46,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:05:46,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:05:46,738 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:05:46,741 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:05:46,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:05:46,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:05:46,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:05:46,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:05:46,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:05:46,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:05:46,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:05:46,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:05:46,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:05:46,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:05:46,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:05:46,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:46,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:05:46,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:05:46,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:05:46,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:05:46,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:05:46,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:05:46,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:05:46,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:05:46,751 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-clean/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-clean/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 -> b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 [2024-10-11 18:05:47,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:05:47,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:05:47,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:05:47,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:05:47,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:05:47,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2024-10-11 18:05:48,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:05:49,071 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:05:49,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2024-10-11 18:05:49,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f957c6e79/ec69f4ab61af4b30b6fb49c23e910c5b/FLAGa74d1d211 [2024-10-11 18:05:49,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f957c6e79/ec69f4ab61af4b30b6fb49c23e910c5b [2024-10-11 18:05:49,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:05:49,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:05:49,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:49,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:05:49,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:05:49,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:49" (1/1) ... [2024-10-11 18:05:49,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f469a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:49, skipping insertion in model container [2024-10-11 18:05:49,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:49" (1/1) ... [2024-10-11 18:05:49,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:49,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:49,976 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-10-11 18:05:49,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b19eedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:49, skipping insertion in model container [2024-10-11 18:05:49,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:49,978 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:05:49,979 INFO L158 Benchmark]: Toolchain (without parser) took 621.52ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 125.5MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 18:05:49,980 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 102.8MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:05:49,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.42ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 125.5MB in the end (delta: -31.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 18:05:49,982 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.73ms. Allocated memory is still 102.8MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.42ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 125.5MB in the end (delta: -31.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:05:52,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:05:52,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:05:52,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:05:52,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:05:52,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:05:52,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:05:52,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:05:52,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:05:52,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:05:52,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:05:52,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:05:52,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:05:52,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:05:52,416 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:05:52,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:05:52,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:05:52,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:05:52,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:05:52,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:05:52,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:05:52,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:05:52,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:05:52,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:05:52,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:05:52,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:05:52,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:05:52,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:05:52,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:05:52,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:05:52,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:05:52,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:05:52,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:05:52,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:05:52,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:05:52,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:52,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:05:52,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:05:52,425 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:05:52,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:05:52,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:05:52,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:05:52,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:05:52,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:05:52,427 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:05:52,427 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-clean/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-clean/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 -> b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 [2024-10-11 18:05:52,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:05:52,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:05:52,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:05:52,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:05:52,840 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:05:52,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2024-10-11 18:05:54,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:05:54,897 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:05:54,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2024-10-11 18:05:54,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97d278d10/6849a5fcb7ce4c678a38bda3ef989c7f/FLAG666980b29 [2024-10-11 18:05:55,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97d278d10/6849a5fcb7ce4c678a38bda3ef989c7f [2024-10-11 18:05:55,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:05:55,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:05:55,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:55,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:05:55,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:05:55,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:55" (1/1) ... [2024-10-11 18:05:55,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5106a453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:55, skipping insertion in model container [2024-10-11 18:05:55,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:05:55" (1/1) ... [2024-10-11 18:05:55,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:55,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:55,874 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:05:55,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:05:55,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:55,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:05:56,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:05:56,108 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:05:56,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56 WrapperNode [2024-10-11 18:05:56,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:05:56,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:05:56,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:05:56,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:05:56,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,185 INFO L138 Inliner]: procedures = 174, calls = 117, calls flagged for inlining = 29, calls inlined = 14, statements flattened = 192 [2024-10-11 18:05:56,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:05:56,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:05:56,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:05:56,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:05:56,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,247 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 29, 4]. 83 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 17 writes are split as follows [0, 13, 4]. [2024-10-11 18:05:56,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:05:56,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:05:56,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:05:56,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:05:56,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (1/1) ... [2024-10-11 18:05:56,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:05:56,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:05:56,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:05:56,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:05:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 18:05:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 18:05:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 18:05:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:05:56,385 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-11 18:05:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-11 18:05:56,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 18:05:56,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-10-11 18:05:56,386 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:05:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:05:56,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:05:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:05:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-11 18:05:56,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-11 18:05:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 18:05:56,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 18:05:56,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:05:56,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:05:56,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:05:56,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:05:57,563 INFO L? ?]: Removed 231 outVars from TransFormulas that were not future-live. [2024-10-11 18:05:57,564 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:05:57,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:05:57,643 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 18:05:57,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:05:57 BoogieIcfgContainer [2024-10-11 18:05:57,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:05:57,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:05:57,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:05:57,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:05:57,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:05:55" (1/3) ... [2024-10-11 18:05:57,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fbb2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:05:57, skipping insertion in model container [2024-10-11 18:05:57,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:05:56" (2/3) ... [2024-10-11 18:05:57,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fbb2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:05:57, skipping insertion in model container [2024-10-11 18:05:57,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:05:57" (3/3) ... [2024-10-11 18:05:57,654 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_3.i [2024-10-11 18:05:57,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:05:57,673 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2024-10-11 18:05:57,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:05:57,732 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;@d5bd975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:05:57,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-10-11 18:05:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 80 states have (on average 2.1375) internal successors, (171), 156 states have internal predecessors, (171), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 18:05:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:57,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:57,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:57,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:05:57,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -671410357, now seen corresponding path program 1 times [2024-10-11 18:05:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860620579] [2024-10-11 18:05:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:57,772 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-10-11 18:05:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:57,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:57,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:57,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:05:57,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:57,984 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-10-11 18:05:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:58,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:58,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:58,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860620579] [2024-10-11 18:05:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860620579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:58,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:05:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425858404] [2024-10-11 18:05:58,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:58,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:05:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:58,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:05:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:05:58,124 INFO L87 Difference]: Start difference. First operand has 171 states, 80 states have (on average 2.1375) internal successors, (171), 156 states have internal predecessors, (171), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:05:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:05:59,053 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2024-10-11 18:05:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:05:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 18:05:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:05:59,068 INFO L225 Difference]: With dead ends: 185 [2024-10-11 18:05:59,069 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 18:05:59,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:05:59,077 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 8 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:05:59,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 638 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:05:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 18:05:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2024-10-11 18:05:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 86 states have (on average 2.046511627906977) internal successors, (176), 161 states have internal predecessors, (176), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 18:05:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 195 transitions. [2024-10-11 18:05:59,135 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 195 transitions. Word has length 11 [2024-10-11 18:05:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:05:59,136 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 195 transitions. [2024-10-11 18:05:59,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:05:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 195 transitions. [2024-10-11 18:05:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:05:59,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:05:59,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:05:59,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:59,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:59,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:05:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:05:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -671410356, now seen corresponding path program 1 times [2024-10-11 18:05:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:05:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228928882] [2024-10-11 18:05:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:05:59,343 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-10-11 18:05:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:05:59,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:59,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:05:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:05:59,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:05:59,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:05:59,464 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-10-11 18:05:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:05:59,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:05:59,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:05:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228928882] [2024-10-11 18:05:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228928882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:05:59,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:05:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:05:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714159690] [2024-10-11 18:05:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:05:59,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:05:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:05:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:05:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:05:59,594 INFO L87 Difference]: Start difference. First operand 178 states and 195 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:00,494 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2024-10-11 18:06:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:06:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 18:06:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:00,497 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:06:00,497 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:06:00,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:06:00,499 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 8 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:00,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 836 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:06:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:06:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-10-11 18:06:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 86 states have (on average 2.0232558139534884) internal successors, (174), 161 states have internal predecessors, (174), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 18:06:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2024-10-11 18:06:00,522 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 11 [2024-10-11 18:06:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2024-10-11 18:06:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2024-10-11 18:06:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:06:00,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:00,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:00,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:00,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:00,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:00,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1071399978, now seen corresponding path program 1 times [2024-10-11 18:06:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021509142] [2024-10-11 18:06:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:00,728 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-10-11 18:06:00,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:00,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:00,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:00,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:06:00,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:00,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:00,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021509142] [2024-10-11 18:06:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021509142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:00,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:00,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:00,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35533637] [2024-10-11 18:06:00,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:00,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:00,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:00,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:00,887 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:01,188 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2024-10-11 18:06:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 18:06:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:01,190 INFO L225 Difference]: With dead ends: 170 [2024-10-11 18:06:01,190 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 18:06:01,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-11 18:06:01,191 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:01,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 616 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:06:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 18:06:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-11 18:06:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 83 states have (on average 2.0120481927710845) internal successors, (167), 154 states have internal predecessors, (167), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 18:06:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2024-10-11 18:06:01,204 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 11 [2024-10-11 18:06:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:01,204 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2024-10-11 18:06:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2024-10-11 18:06:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:06:01,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:01,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:01,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:01,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash -671496373, now seen corresponding path program 1 times [2024-10-11 18:06:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636543718] [2024-10-11 18:06:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:01,408 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-10-11 18:06:01,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:01,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:01,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:01,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:06:01,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:01,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:01,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636543718] [2024-10-11 18:06:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636543718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703025650] [2024-10-11 18:06:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:01,533 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 18:06:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:01,774 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2024-10-11 18:06:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-10-11 18:06:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:01,777 INFO L225 Difference]: With dead ends: 171 [2024-10-11 18:06:01,777 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 18:06:01,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-11 18:06:01,779 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 87 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:01,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 520 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 18:06:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-10-11 18:06:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 83 states have (on average 2.0) internal successors, (166), 154 states have internal predecessors, (166), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 18:06:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2024-10-11 18:06:01,793 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 11 [2024-10-11 18:06:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:01,793 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2024-10-11 18:06:01,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 18:06:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2024-10-11 18:06:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:06:01,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:01,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:01,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:01,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:01,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1071313962, now seen corresponding path program 1 times [2024-10-11 18:06:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308457998] [2024-10-11 18:06:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:01,997 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-10-11 18:06:01,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:02,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:02,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:02,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:06:02,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:02,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:02,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308457998] [2024-10-11 18:06:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308457998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862539494] [2024-10-11 18:06:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:02,117 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:06:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:02,339 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2024-10-11 18:06:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:02,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-10-11 18:06:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:02,341 INFO L225 Difference]: With dead ends: 172 [2024-10-11 18:06:02,341 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 18:06:02,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-11 18:06:02,342 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 81 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:02,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 529 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 18:06:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-11 18:06:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 85 states have (on average 1.9764705882352942) internal successors, (168), 156 states have internal predecessors, (168), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 18:06:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2024-10-11 18:06:02,359 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 11 [2024-10-11 18:06:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2024-10-11 18:06:02,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 18:06:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2024-10-11 18:06:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:06:02,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:02,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:02,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:02,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1148985436, now seen corresponding path program 1 times [2024-10-11 18:06:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717690796] [2024-10-11 18:06:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:02,563 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-10-11 18:06:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:02,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:02,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:02,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:06:02,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:02,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:02,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717690796] [2024-10-11 18:06:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717690796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:06:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004600986] [2024-10-11 18:06:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:02,658 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:02,977 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-10-11 18:06:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 18:06:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:02,979 INFO L225 Difference]: With dead ends: 184 [2024-10-11 18:06:02,979 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 18:06:02,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-11 18:06:02,981 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:02,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 291 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:06:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 18:06:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2024-10-11 18:06:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 80 states have (on average 2.025) internal successors, (162), 151 states have internal predecessors, (162), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 18:06:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2024-10-11 18:06:03,001 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 12 [2024-10-11 18:06:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:03,001 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2024-10-11 18:06:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:06:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2024-10-11 18:06:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:06:03,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:03,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:03,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 18:06:03,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:03,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -322984536, now seen corresponding path program 1 times [2024-10-11 18:06:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334930693] [2024-10-11 18:06:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:03,205 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-10-11 18:06:03,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:03,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:03,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:03,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:06:03,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:03,359 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-10-11 18:06:03,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:03,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:03,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:03,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334930693] [2024-10-11 18:06:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334930693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066139855] [2024-10-11 18:06:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2024-10-11 18:06:03,512 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:06:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:04,157 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2024-10-11 18:06:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:06:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 18:06:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:04,159 INFO L225 Difference]: With dead ends: 176 [2024-10-11 18:06:04,159 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 18:06:04,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2024-10-11 18:06:04,160 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 47 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:04,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 286 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 0 Unknown, 196 Unchecked, 0.6s Time] [2024-10-11 18:06:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 18:06:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-10-11 18:06:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 80 states have (on average 2.0125) internal successors, (161), 150 states have internal predecessors, (161), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 18:06:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2024-10-11 18:06:04,168 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 14 [2024-10-11 18:06:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:04,168 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2024-10-11 18:06:04,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:06:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2024-10-11 18:06:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:06:04,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:04,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:04,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 18:06:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:04,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:04,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -322984537, now seen corresponding path program 1 times [2024-10-11 18:06:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:04,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212756750] [2024-10-11 18:06:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:04,372 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-10-11 18:06:04,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:04,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:04,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:04,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:06:04,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:04,577 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:06:04,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:06:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:04,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:04,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212756750] [2024-10-11 18:06:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212756750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539758181] [2024-10-11 18:06:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:06:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:06:04,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:06:04,629 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (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-10-11 18:06:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:05,464 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2024-10-11 18:06:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:06:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (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 14 [2024-10-11 18:06:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:05,465 INFO L225 Difference]: With dead ends: 211 [2024-10-11 18:06:05,466 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 18:06:05,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:06:05,466 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 165 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:05,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 348 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:06:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 18:06:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 173. [2024-10-11 18:06:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 157 states have internal predecessors, (173), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-11 18:06:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2024-10-11 18:06:05,473 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 14 [2024-10-11 18:06:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2024-10-11 18:06:05,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (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-10-11 18:06:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2024-10-11 18:06:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:06:05,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:05,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:05,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:05,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:05,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2043507658, now seen corresponding path program 1 times [2024-10-11 18:06:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139433139] [2024-10-11 18:06:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:05,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:05,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:05,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:06:05,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:05,785 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-10-11 18:06:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:05,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:05,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139433139] [2024-10-11 18:06:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139433139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123146650] [2024-10-11 18:06:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:05,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:05,811 INFO L87 Difference]: Start difference. First operand 173 states and 191 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:06,210 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2024-10-11 18:06:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-11 18:06:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:06,212 INFO L225 Difference]: With dead ends: 215 [2024-10-11 18:06:06,212 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 18:06:06,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-10-11 18:06:06,212 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:06,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 393 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:06:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 18:06:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2024-10-11 18:06:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 2.0186915887850465) internal successors, (216), 175 states have internal predecessors, (216), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-11 18:06:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 234 transitions. [2024-10-11 18:06:06,220 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 234 transitions. Word has length 20 [2024-10-11 18:06:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:06,220 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 234 transitions. [2024-10-11 18:06:06,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 234 transitions. [2024-10-11 18:06:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:06:06,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:06,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:06,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:06,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:06,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:06,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2043507657, now seen corresponding path program 1 times [2024-10-11 18:06:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240822455] [2024-10-11 18:06:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:06,424 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-10-11 18:06:06,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:06,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:06,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:06,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:06:06,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:06,542 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-10-11 18:06:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:06,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:06,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240822455] [2024-10-11 18:06:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240822455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:06,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:06,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969822712] [2024-10-11 18:06:06,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:06,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:06,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:06,608 INFO L87 Difference]: Start difference. First operand 191 states and 234 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:07,097 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2024-10-11 18:06:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:07,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-11 18:06:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:07,098 INFO L225 Difference]: With dead ends: 213 [2024-10-11 18:06:07,098 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 18:06:07,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-10-11 18:06:07,099 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:07,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 409 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:06:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 18:06:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 192. [2024-10-11 18:06:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 109 states have (on average 1.9908256880733946) internal successors, (217), 175 states have internal predecessors, (217), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2024-10-11 18:06:07,107 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 20 [2024-10-11 18:06:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:07,107 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2024-10-11 18:06:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2024-10-11 18:06:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:06:07,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:07,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:07,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:07,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1010739017, now seen corresponding path program 1 times [2024-10-11 18:06:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812291882] [2024-10-11 18:06:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:07,311 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-10-11 18:06:07,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:07,312 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:07,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:06:07,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:07,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:07,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812291882] [2024-10-11 18:06:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812291882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319659249] [2024-10-11 18:06:07,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:06:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:06:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:06:07,429 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:07,622 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2024-10-11 18:06:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:06:07,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-11 18:06:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:07,623 INFO L225 Difference]: With dead ends: 192 [2024-10-11 18:06:07,623 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 18:06:07,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-10-11 18:06:07,624 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:07,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 489 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 18:06:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 18:06:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 109 states have (on average 1.981651376146789) internal successors, (216), 175 states have internal predecessors, (216), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2024-10-11 18:06:07,631 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 22 [2024-10-11 18:06:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:07,631 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2024-10-11 18:06:07,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2024-10-11 18:06:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:06:07,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:07,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:07,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2015939960, now seen corresponding path program 1 times [2024-10-11 18:06:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016927774] [2024-10-11 18:06:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:07,834 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-10-11 18:06:07,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:07,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:07,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:06:07,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:08,006 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-10-11 18:06:08,047 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:08,048 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-10-11 18:06:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:08,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:08,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016927774] [2024-10-11 18:06:08,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016927774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:06:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433532609] [2024-10-11 18:06:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:08,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:06:08,123 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:08,740 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-10-11 18:06:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:08,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 18:06:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:08,742 INFO L225 Difference]: With dead ends: 204 [2024-10-11 18:06:08,742 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 18:06:08,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:06:08,742 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:08,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 356 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:06:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 18:06:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 188. [2024-10-11 18:06:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 109 states have (on average 1.908256880733945) internal successors, (208), 171 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 229 transitions. [2024-10-11 18:06:08,750 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 229 transitions. Word has length 26 [2024-10-11 18:06:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:08,751 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 229 transitions. [2024-10-11 18:06:08,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 229 transitions. [2024-10-11 18:06:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:06:08,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:08,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:08,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 18:06:08,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:08,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2015939959, now seen corresponding path program 1 times [2024-10-11 18:06:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105886476] [2024-10-11 18:06:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:08,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:08,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:08,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:09,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:06:09,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:09,171 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-10-11 18:06:09,180 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-10-11 18:06:09,225 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#res#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#res#1.base| (select |c_#length| |ldv_zalloc_#res#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#res#1.base|)))) is different from true [2024-10-11 18:06:09,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:09,251 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:06:09,252 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-10-11 18:06:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:09,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:09,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105886476] [2024-10-11 18:06:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105886476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:06:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40817443] [2024-10-11 18:06:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:09,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:09,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-10-11 18:06:09,320 INFO L87 Difference]: Start difference. First operand 188 states and 229 transitions. Second operand has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:10,033 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2024-10-11 18:06:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 18:06:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:10,038 INFO L225 Difference]: With dead ends: 214 [2024-10-11 18:06:10,038 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 18:06:10,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2024-10-11 18:06:10,039 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 93 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:10,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 312 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 460 Invalid, 0 Unknown, 242 Unchecked, 0.7s Time] [2024-10-11 18:06:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 18:06:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 188. [2024-10-11 18:06:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 109 states have (on average 1.871559633027523) internal successors, (204), 171 states have internal predecessors, (204), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2024-10-11 18:06:10,046 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 26 [2024-10-11 18:06:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:10,047 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2024-10-11 18:06:10,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2024-10-11 18:06:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:06:10,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:10,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:10,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 18:06:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:10,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -288090404, now seen corresponding path program 1 times [2024-10-11 18:06:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:10,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269951951] [2024-10-11 18:06:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:10,250 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-10-11 18:06:10,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:10,252 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:10,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:10,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:10,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:10,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:10,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269951951] [2024-10-11 18:06:10,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269951951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:10,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414853100] [2024-10-11 18:06:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:10,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:10,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:10,406 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:10,622 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2024-10-11 18:06:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:10,623 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-11 18:06:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:10,624 INFO L225 Difference]: With dead ends: 192 [2024-10-11 18:06:10,625 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 18:06:10,625 INFO L431 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-10-11 18:06:10,625 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:10,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 18:06:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 18:06:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 113 states have (on average 1.8407079646017699) internal successors, (208), 175 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2024-10-11 18:06:10,632 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 28 [2024-10-11 18:06:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:10,635 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2024-10-11 18:06:10,635 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2024-10-11 18:06:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:06:10,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:10,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:10,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -340867843, now seen corresponding path program 1 times [2024-10-11 18:06:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025006644] [2024-10-11 18:06:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:10,838 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-10-11 18:06:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:10,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:10,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:06:10,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:11,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:11,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:11,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025006644] [2024-10-11 18:06:11,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025006644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486909961] [2024-10-11 18:06:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:06:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:11,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:06:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:06:11,339 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:11,885 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2024-10-11 18:06:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-11 18:06:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:11,887 INFO L225 Difference]: With dead ends: 190 [2024-10-11 18:06:11,887 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 18:06:11,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:06:11,888 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 184 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:11,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 400 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:06:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 18:06:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-11 18:06:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 113 states have (on average 1.8141592920353982) internal successors, (205), 173 states have internal predecessors, (205), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2024-10-11 18:06:11,895 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 29 [2024-10-11 18:06:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:11,896 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2024-10-11 18:06:11,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2024-10-11 18:06:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:06:11,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:11,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:11,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 18:06:12,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:12,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:12,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1712785962, now seen corresponding path program 1 times [2024-10-11 18:06:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161730182] [2024-10-11 18:06:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:12,101 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-10-11 18:06:12,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:12,102 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:12,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 18:06:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:12,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:06:12,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:12,286 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-10-11 18:06:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:12,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:12,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:12,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161730182] [2024-10-11 18:06:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161730182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962440341] [2024-10-11 18:06:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:12,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:06:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:06:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:06:12,362 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:12,769 INFO L93 Difference]: Finished difference Result 200 states and 225 transitions. [2024-10-11 18:06:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:06:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:06:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:12,771 INFO L225 Difference]: With dead ends: 200 [2024-10-11 18:06:12,772 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 18:06:12,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-10-11 18:06:12,772 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 30 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:12,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 472 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:06:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 18:06:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2024-10-11 18:06:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 113 states have (on average 1.7876106194690264) internal successors, (202), 172 states have internal predecessors, (202), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2024-10-11 18:06:12,778 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 32 [2024-10-11 18:06:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:12,779 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2024-10-11 18:06:12,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2024-10-11 18:06:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:06:12,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:12,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:12,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 18:06:12,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:12,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:12,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1712785961, now seen corresponding path program 1 times [2024-10-11 18:06:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:12,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912929071] [2024-10-11 18:06:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:12,982 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-10-11 18:06:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:12,984 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:12,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:13,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:06:13,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:13,153 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-10-11 18:06:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:13,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:13,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912929071] [2024-10-11 18:06:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912929071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:13,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:06:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377406761] [2024-10-11 18:06:13,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:13,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:06:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:06:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:06:13,269 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:13,785 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2024-10-11 18:06:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:06:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:06:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:13,786 INFO L225 Difference]: With dead ends: 198 [2024-10-11 18:06:13,786 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 18:06:13,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-10-11 18:06:13,787 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 26 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:13,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 480 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:06:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 18:06:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2024-10-11 18:06:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 113 states have (on average 1.7699115044247788) internal successors, (200), 172 states have internal predecessors, (200), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 221 transitions. [2024-10-11 18:06:13,793 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 221 transitions. Word has length 32 [2024-10-11 18:06:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 221 transitions. [2024-10-11 18:06:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 221 transitions. [2024-10-11 18:06:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:06:13,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:13,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:13,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:13,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:13,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1024310991, now seen corresponding path program 1 times [2024-10-11 18:06:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242879802] [2024-10-11 18:06:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:13,997 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-10-11 18:06:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:14,000 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:14,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:14,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:14,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:14,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242879802] [2024-10-11 18:06:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242879802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:14,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:14,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601895956] [2024-10-11 18:06:14,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:14,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:14,166 INFO L87 Difference]: Start difference. First operand 189 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:14,357 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2024-10-11 18:06:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-11 18:06:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:14,359 INFO L225 Difference]: With dead ends: 191 [2024-10-11 18:06:14,359 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 18:06:14,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-11 18:06:14,360 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:14,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 18:06:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-11 18:06:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 115 states have (on average 1.7565217391304349) internal successors, (202), 174 states have internal predecessors, (202), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 18:06:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2024-10-11 18:06:14,366 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 33 [2024-10-11 18:06:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:14,366 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2024-10-11 18:06:14,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2024-10-11 18:06:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:06:14,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:14,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:14,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1014826118, now seen corresponding path program 1 times [2024-10-11 18:06:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580309384] [2024-10-11 18:06:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:14,570 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-10-11 18:06:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:14,573 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:14,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:06:14,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:15,128 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-10-11 18:06:15,189 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:15,189 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-10-11 18:06:15,253 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-10-11 18:06:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-11 18:06:15,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:06:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:15,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:15,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580309384] [2024-10-11 18:06:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580309384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:06:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499965214] [2024-10-11 18:06:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:15,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:06:15,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:15,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:06:15,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:06:15,537 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:17,595 INFO L93 Difference]: Finished difference Result 236 states and 277 transitions. [2024-10-11 18:06:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:06:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-11 18:06:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:17,597 INFO L225 Difference]: With dead ends: 236 [2024-10-11 18:06:17,597 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 18:06:17,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-10-11 18:06:17,597 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 559 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:17,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 585 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:06:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 18:06:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 207. [2024-10-11 18:06:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 189 states have internal predecessors, (232), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 18:06:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2024-10-11 18:06:17,603 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 34 [2024-10-11 18:06:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2024-10-11 18:06:17,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2024-10-11 18:06:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:06:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:17,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:17,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:17,805 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1014826117, now seen corresponding path program 1 times [2024-10-11 18:06:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506140403] [2024-10-11 18:06:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:17,806 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-10-11 18:06:17,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:17,810 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:17,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:18,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:06:18,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:18,163 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 8 treesize of output 1 [2024-10-11 18:06:18,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:18,393 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-11 18:06:18,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-11 18:06:18,506 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-10-11 18:06:18,514 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-10-11 18:06:18,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-11 18:06:18,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 11 [2024-10-11 18:06:18,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:06:18,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:06:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:18,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:18,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506140403] [2024-10-11 18:06:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506140403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:18,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:06:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362460527] [2024-10-11 18:06:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:18,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:06:18,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:18,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:06:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:06:18,862 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:21,034 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2024-10-11 18:06:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:06:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-11 18:06:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:21,036 INFO L225 Difference]: With dead ends: 224 [2024-10-11 18:06:21,036 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 18:06:21,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-10-11 18:06:21,038 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 357 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:21,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 484 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:06:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 18:06:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2024-10-11 18:06:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.7272727272727273) internal successors, (228), 188 states have internal predecessors, (228), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 18:06:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 251 transitions. [2024-10-11 18:06:21,051 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 251 transitions. Word has length 34 [2024-10-11 18:06:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:21,051 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 251 transitions. [2024-10-11 18:06:21,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 251 transitions. [2024-10-11 18:06:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:06:21,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:21,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:21,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:21,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:21,256 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:21,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 815425750, now seen corresponding path program 1 times [2024-10-11 18:06:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476889588] [2024-10-11 18:06:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:21,257 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-10-11 18:06:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:21,260 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:21,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:21,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:06:21,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:21,599 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-11 18:06:21,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 18:06:21,641 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-10-11 18:06:21,750 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2024-10-11 18:06:21,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2024-10-11 18:06:22,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:22,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-11 18:06:22,104 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 18:06:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:22,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:22,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476889588] [2024-10-11 18:06:22,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476889588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:22,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:22,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:06:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143941583] [2024-10-11 18:06:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:06:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:06:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:06:22,143 INFO L87 Difference]: Start difference. First operand 206 states and 251 transitions. Second operand has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:23,807 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2024-10-11 18:06:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:06:23,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-11 18:06:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:23,811 INFO L225 Difference]: With dead ends: 293 [2024-10-11 18:06:23,811 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 18:06:23,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:06:23,812 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 452 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:23,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 510 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 18:06:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 18:06:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 224. [2024-10-11 18:06:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.722972972972973) internal successors, (255), 202 states have internal predecessors, (255), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-11 18:06:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2024-10-11 18:06:23,838 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 35 [2024-10-11 18:06:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:23,838 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2024-10-11 18:06:23,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:06:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2024-10-11 18:06:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:06:23,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:23,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:23,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:24,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:24,040 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:24,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 815425751, now seen corresponding path program 1 times [2024-10-11 18:06:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925865807] [2024-10-11 18:06:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:24,041 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-10-11 18:06:24,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:24,043 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:24,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 18:06:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:24,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 18:06:24,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:24,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:24,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:24,402 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:06:24,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 18:06:24,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:24,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:06:24,688 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:06:24,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:06:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:24,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:24,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925865807] [2024-10-11 18:06:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925865807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:06:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077565232] [2024-10-11 18:06:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:06:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:24,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:06:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:06:24,865 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:26,828 INFO L93 Difference]: Finished difference Result 247 states and 300 transitions. [2024-10-11 18:06:26,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:06:26,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-10-11 18:06:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:26,831 INFO L225 Difference]: With dead ends: 247 [2024-10-11 18:06:26,831 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 18:06:26,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:06:26,832 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 455 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:26,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 261 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 18:06:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 18:06:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2024-10-11 18:06:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 143 states have (on average 1.6853146853146854) internal successors, (241), 194 states have internal predecessors, (241), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 18:06:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2024-10-11 18:06:26,838 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 35 [2024-10-11 18:06:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:26,838 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2024-10-11 18:06:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2024-10-11 18:06:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:26,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:26,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:26,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:27,039 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash -290179444, now seen corresponding path program 1 times [2024-10-11 18:06:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245708637] [2024-10-11 18:06:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:06:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:27,042 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:27,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:27,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:06:27,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:27,693 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-10-11 18:06:27,774 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-10-11 18:06:27,796 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-10-11 18:06:27,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2024-10-11 18:06:27,831 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 5 [2024-10-11 18:06:27,890 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2024-10-11 18:06:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2024-10-11 18:06:28,011 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-11 18:06:28,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2024-10-11 18:06:28,036 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-10-11 18:06:28,261 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:06:28,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 54 [2024-10-11 18:06:28,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-11 18:06:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:06:29,434 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2024-10-11 18:06:29,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 109 [2024-10-11 18:06:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:30,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:30,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245708637] [2024-10-11 18:06:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245708637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 18:06:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448924062] [2024-10-11 18:06:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:06:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:06:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:06:30,028 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand has 19 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:33,165 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2024-10-11 18:06:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:06:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-10-11 18:06:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:33,167 INFO L225 Difference]: With dead ends: 239 [2024-10-11 18:06:33,167 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 18:06:33,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-10-11 18:06:33,168 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 234 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:33,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 689 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 18:06:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 18:06:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 216. [2024-10-11 18:06:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 144 states have (on average 1.6597222222222223) internal successors, (239), 195 states have internal predecessors, (239), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 18:06:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 262 transitions. [2024-10-11 18:06:33,175 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 262 transitions. Word has length 36 [2024-10-11 18:06:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:33,175 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 262 transitions. [2024-10-11 18:06:33,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 262 transitions. [2024-10-11 18:06:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:33,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:33,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:33,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:33,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:33,378 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -290179443, now seen corresponding path program 1 times [2024-10-11 18:06:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733810039] [2024-10-11 18:06:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:33,380 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-10-11 18:06:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:33,383 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:33,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:34,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-11 18:06:34,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:34,119 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-10-11 18:06:34,162 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:34,162 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-10-11 18:06:34,346 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-10-11 18:06:34,390 INFO L349 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2024-10-11 18:06:34,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2024-10-11 18:06:34,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:06:34,414 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-10-11 18:06:34,461 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 9 treesize of output 3 [2024-10-11 18:06:34,475 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:34,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2024-10-11 18:06:34,584 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-10-11 18:06:34,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2024-10-11 18:06:34,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:06:34,717 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 29 treesize of output 24 [2024-10-11 18:06:34,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:34,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:06:34,893 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:06:34,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 27 [2024-10-11 18:06:34,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-10-11 18:06:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:34,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-10-11 18:06:35,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 18:06:35,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:06:35,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2024-10-11 18:06:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:06:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:35,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:35,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733810039] [2024-10-11 18:06:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733810039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 18:06:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522331863] [2024-10-11 18:06:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:06:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:06:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:06:35,684 INFO L87 Difference]: Start difference. First operand 216 states and 262 transitions. Second operand has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:40,100 INFO L93 Difference]: Finished difference Result 304 states and 351 transitions. [2024-10-11 18:06:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 18:06:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-10-11 18:06:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:40,103 INFO L225 Difference]: With dead ends: 304 [2024-10-11 18:06:40,103 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 18:06:40,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:06:40,104 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 326 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:40,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 958 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 18:06:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 18:06:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 244. [2024-10-11 18:06:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 169 states have (on average 1.6153846153846154) internal successors, (273), 221 states have internal predecessors, (273), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-11 18:06:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 298 transitions. [2024-10-11 18:06:40,115 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 298 transitions. Word has length 36 [2024-10-11 18:06:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:40,116 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 298 transitions. [2024-10-11 18:06:40,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 298 transitions. [2024-10-11 18:06:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:40,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:40,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:40,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,317 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:40,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -491585416, now seen corresponding path program 1 times [2024-10-11 18:06:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342746276] [2024-10-11 18:06:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:40,318 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-10-11 18:06:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:40,323 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:40,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:06:40,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:40,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:40,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342746276] [2024-10-11 18:06:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342746276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:40,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:06:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431384422] [2024-10-11 18:06:40,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:40,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:06:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:06:40,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:40,506 INFO L87 Difference]: Start difference. First operand 244 states and 298 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:40,752 INFO L93 Difference]: Finished difference Result 246 states and 299 transitions. [2024-10-11 18:06:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:06:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-11 18:06:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:40,755 INFO L225 Difference]: With dead ends: 246 [2024-10-11 18:06:40,755 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 18:06:40,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:06:40,756 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:40,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:06:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 18:06:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-11 18:06:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 171 states have (on average 1.6023391812865497) internal successors, (274), 223 states have internal predecessors, (274), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-11 18:06:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 299 transitions. [2024-10-11 18:06:40,768 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 299 transitions. Word has length 36 [2024-10-11 18:06:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 299 transitions. [2024-10-11 18:06:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:06:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 299 transitions. [2024-10-11 18:06:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:06:40,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:40,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:40,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 18:06:40,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,978 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:40,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 730888911, now seen corresponding path program 1 times [2024-10-11 18:06:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120800733] [2024-10-11 18:06:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:40,979 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-10-11 18:06:40,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:40,983 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:40,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:41,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 18:06:41,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:41,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 5 [2024-10-11 18:06:41,688 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:41,689 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-10-11 18:06:41,846 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-10-11 18:06:41,849 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-10-11 18:06:41,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:41,856 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 18 treesize of output 13 [2024-10-11 18:06:41,887 INFO L349 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2024-10-11 18:06:41,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2024-10-11 18:06:41,960 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 9 treesize of output 3 [2024-10-11 18:06:41,973 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:41,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2024-10-11 18:06:42,081 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:06:42,081 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 18 treesize of output 21 [2024-10-11 18:06:42,131 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-10-11 18:06:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2024-10-11 18:06:42,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-10-11 18:06:42,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:42,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:06:42,434 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:06:42,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2024-10-11 18:06:42,457 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:06:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 27 [2024-10-11 18:06:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:42,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:06:42,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:06:42,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2024-10-11 18:06:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:42,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:42,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120800733] [2024-10-11 18:06:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120800733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 18:06:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940907802] [2024-10-11 18:06:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:06:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:06:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:06:42,914 INFO L87 Difference]: Start difference. First operand 246 states and 299 transitions. Second operand has 20 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:46,661 INFO L93 Difference]: Finished difference Result 299 states and 342 transitions. [2024-10-11 18:06:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:06:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-10-11 18:06:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:46,662 INFO L225 Difference]: With dead ends: 299 [2024-10-11 18:06:46,662 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 18:06:46,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:06:46,663 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 265 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:46,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 931 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 18:06:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 18:06:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 246. [2024-10-11 18:06:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 171 states have (on average 1.590643274853801) internal successors, (272), 223 states have internal predecessors, (272), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-11 18:06:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 297 transitions. [2024-10-11 18:06:46,669 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 297 transitions. Word has length 36 [2024-10-11 18:06:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:46,670 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 297 transitions. [2024-10-11 18:06:46,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 297 transitions. [2024-10-11 18:06:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:06:46,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:46,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:46,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:46,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:46,872 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:46,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 13738092, now seen corresponding path program 1 times [2024-10-11 18:06:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799176538] [2024-10-11 18:06:46,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:46,873 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-10-11 18:06:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:46,874 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:46,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Waiting until timeout for monitored process [2024-10-11 18:06:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:47,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 18:06:47,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:47,167 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:06:47,167 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-10-11 18:06:47,293 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-10-11 18:06:47,323 INFO L349 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2024-10-11 18:06:47,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2024-10-11 18:06:47,375 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:47,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2024-10-11 18:06:47,453 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2024-10-11 18:06:47,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2024-10-11 18:06:47,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-11 18:06:47,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-11 18:06:47,940 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:47,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2024-10-11 18:06:48,014 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-10-11 18:06:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:48,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:48,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799176538] [2024-10-11 18:06:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799176538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:48,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 18:06:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188149393] [2024-10-11 18:06:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:48,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:06:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:06:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:06:48,072 INFO L87 Difference]: Start difference. First operand 246 states and 297 transitions. Second operand has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:06:50,066 INFO L93 Difference]: Finished difference Result 344 states and 385 transitions. [2024-10-11 18:06:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:06:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 18:06:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:06:50,068 INFO L225 Difference]: With dead ends: 344 [2024-10-11 18:06:50,068 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 18:06:50,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:06:50,068 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 336 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:06:50,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 790 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:06:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 18:06:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 262. [2024-10-11 18:06:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 184 states have (on average 1.5706521739130435) internal successors, (289), 237 states have internal predecessors, (289), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2024-10-11 18:06:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2024-10-11 18:06:50,078 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 38 [2024-10-11 18:06:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:06:50,079 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2024-10-11 18:06:50,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2024-10-11 18:06:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:06:50,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:06:50,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:06:50,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 18:06:50,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:50,280 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2024-10-11 18:06:50,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:06:50,281 INFO L85 PathProgramCache]: Analyzing trace with hash 13738093, now seen corresponding path program 1 times [2024-10-11 18:06:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:06:50,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972652482] [2024-10-11 18:06:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:06:50,281 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-10-11 18:06:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:06:50,284 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:50,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:06:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:06:50,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-11 18:06:50,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:06:50,570 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-10-11 18:06:50,654 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 18:06:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 18:06:50,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:06:50,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:06:50,994 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2024-10-11 18:06:50,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2024-10-11 18:06:51,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:06:51,020 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-10-11 18:06:51,087 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 18:06:51,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2024-10-11 18:06:51,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:06:51,340 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-10-11 18:06:51,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2024-10-11 18:06:51,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:06:51,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:06:51,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-11 18:06:51,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:06:51,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-11 18:06:52,972 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 41 treesize of output 21 [2024-10-11 18:06:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:06:53,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:06:53,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:06:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972652482] [2024-10-11 18:06:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972652482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:06:53,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:06:53,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 18:06:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253761837] [2024-10-11 18:06:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:06:53,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:06:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:06:53,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:06:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:06:53,390 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand has 19 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:06:58,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:07:11,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]